Results 61 to 70 of about 150,702 (264)
The Monomial Preconditioned SSOR Method for Linear Complementarity Problem
This paper aims to show that the existing preconditioned symmetric successive over-relaxation (SSOR) approach to solving the linear complementarity problem (LCP) is not valid.
Xinna Mao +3 more
doaj +1 more source
Note on error bounds for linear complementarity problems involving BS-matrices
Using the range for the infinity norm of inverse matrix of a strictly diagonally dominant M-matrix, some new error bounds for the linear complementarity problem are obtained when the involved matrix is a BS-matrix.
Deshu Sun
doaj +1 more source
Sequence determinants of RNA G‐quadruplex unfolding by Arg‐rich regions
We show that Arg‐rich peptides selectively unfold RNA G‐quadruplexes, but not RNA stem‐loops or DNA/RNA duplexes. This length‐dependent activity is inhibited by acidic residues and is conserved among SR and SR‐related proteins (SRSF1, SRSF3, SRSF9, U1‐70K, and U2AF1).
Naiduwadura Ivon Upekala De Silva +10 more
wiley +1 more source
Combined approach to solve linear complementarity problem
In this paper, we present a new approach in order to solve the linear complementary problem noted (LCP). We have combined the ideas of Lemke's method and its variants taking advantage of the benefits of each approach in order to improve the convergence ...
Kebbiche Zakia, Roumili Hayet
doaj +2 more sources
A class of singular Ro-matrices and extensions to semidefinite linear complementarity problems [PDF]
For ARnxn and qRn, the linear complementarity problem LCP(A, q) is to determine if there is xRn such that x ≥ 0; y = Ax + q ≥ 0 and xT y = 0. Such an x is called a solution of LCP(A,q).
Sivakumar K.C.
doaj +1 more source
Cell wall target fragment discovery using a low‐cost, minimal fragment library
LoCoFrag100 is a fragment library made up of 100 different compounds. Similarity between the fragments is minimized and 10 different fragments are mixed into a single cocktail, which is soaked to protein crystals. These crystals are analysed by X‐ray crystallography, revealing the binding modes of the bound fragment ligands.
Kaizhou Yan +5 more
wiley +1 more source
A Full-Newton step infeasible-interior-point algorithm for P*(k)-horizontal linear complementarity problems [PDF]
In this paper we generalize an infeasible interior-point method for linear optimization to horizontal linear complementarity problem (HLCP). This algorithm starts from strictly feasible iterates on the central path of a perturbed problem that is
Asadi S., Mansouri H.
doaj +1 more source
We reconstituted Synechocystis glycogen synthesis in vitro from purified enzymes and showed that two GlgA isoenzymes produce glycogen with different architectures: GlgA1 yields denser, highly branched glycogen, whereas GlgA2 synthesizes longer, less‐branched chains.
Kenric Lee +3 more
wiley +1 more source
Improved Full-Newton-Step Infeasible Interior-Point Method for Linear Complementarity Problems
We present an Infeasible Interior-Point Method for monotone Linear Complementarity Problem (LCP) which is an improved version of the algorithm given in [13]. In the earlier version, each iteration consisted of one feasibility step and few centering steps.
Goran Lešaja, Mustafa Ozen
doaj +1 more source
Structural biology of ferritin nanocages
Ferritin is a conserved iron‐storage protein that sequesters iron as a ferric mineral core within a nanocage, protecting cells from oxidative damage and maintaining iron homeostasis. This review discusses ferritin biology, structure, and function, and highlights recent cryo‐EM studies revealing mechanisms of ferritinophagy, cellular iron uptake, and ...
Eloise Mastrangelo, Flavio Di Pisa
wiley +1 more source

