Results 101 to 110 of about 867,669 (246)

Biointerface Membranes Orchestrating Site‐Specific Osteoimmunomodulatory and Antibacterial Effects for Enhanced Osseous Regeneration in Periodontal Therapy

open access: yesAdvanced Functional Materials, EarlyView.
Here, a biointerface membrane engineered with site‐specific interfacial properties is developed. During implantation between gingival and bone defect, the membrane creates a pro‐osteogenic microenvironment, precisely modulates cellular activities at each biointerface, and facilitates the orchestration of complex healing events, ultimately leading to ...
Yuwei Zhu   +13 more
wiley   +1 more source

On general fixed point method based on matrix splitting for solving linear complementarity problem

open access: yesJournal of Numerical Analysis and Approximation Theory, 2022
In this article, we introduce a modified fixed point method to process the large and sparse linear complementarity problem (LCP) and formulate an equivalent fixed point equation for the LCP and show the equivalence.
Bharat Kumar, Deepmala, A. K. Das
doaj  

A Preconditioned Multisplitting and Schwarz Method for Linear Complementarity Problem

open access: yesJournal of Applied Mathematics, 2014
The preconditioner presented by Hadjidimos et al. (2003) can improve on the convergence rate of the classical iterative methods to solve linear systems.
Cuiyu Liu, Chen-liang Li
doaj   +1 more source

Convergence analysis of modulus-based matrix splitting iterative methods for implicit complementarity problems

open access: yesJournal of Inequalities and Applications, 2018
In this paper, we demonstrate a complete version of the convergence theory of the modulus-based matrix splitting iteration methods for solving a class of implicit complementarity problems proposed by Hong and Li (Numer. Linear Algebra Appl.
An Wang, Yang Cao, Quan Shi
doaj   +1 more source

An Application of the Khachian-Shor Algorithm to a Class of Linear Complementary Problems [PDF]

open access: yes
The recent ellipsoidal method for solving linear programs due to Khachian and Shor is shown to process linear complementarity problems with positive semidefinite matrix.
Ilan Adler   +2 more
core  

Parametric Linear Complementarity Problems

open access: yes, 2005
We study linear complementarity problems depending on parameters in the right-hand side and (or) in the matrix. For the case that all elements of the right-hand side are independent parameters we give a new proof for the equivalence of three different important local properties of the corresponding solution set map in a neighbourhood of an element of ...
openaire   +1 more source

On the Continuous-Time Complementarity Problem

open access: yesTrends in Computational and Applied Mathematics
This work deals with solving continuous-time nonlinear complementarity problems defined on two types of nonempty closed convex cones: a polyhedral cone (positive octant) and a second-order cone.
M. R. C. do Monte, V. A. de Oliveira
doaj   +1 more source

A Quadratically Convergent Interior-Point Algorithm for the P*(κ)-Matrix Horizontal Linear Complementarity Problem [PDF]

open access: yesJournal of Sciences, Islamic Republic of Iran, 2012
In this paper, we present a new path-following interior-point algorithm for -horizontal linear complementarity problems (HLCPs). The algorithm uses only full-Newton steps which has the advantage that no line searchs are needed.
H. Mansouri
doaj  

Fast solution strategies for time-space fractional linear complementarity problems governing American options pricing

open access: yesDemonstratio Mathematica
Fractional derivatives are widely used in various fields to model the historical dependence or spatial globalization of the solutions because of their nonlocal properties.
Chen Xu   +3 more
doaj   +1 more source

An infeasible interior point methods for convex quadratic problems

open access: yesJournal of Numerical Analysis and Approximation Theory, 2018
In this paper, we deal with the study and implementation of an infeasible interior point method for convex quadratic problems (CQP). The algorithm uses a Newton step and suitable proximity measure for approximately tracing the central path and ...
Hayet Roumili, Nawel Boudjellal
doaj   +2 more sources

Home - About - Disclaimer - Privacy