Results 61 to 70 of about 2,659,919 (342)
Optimal Fine-grained Hardness of Approximation of Linear Equations [PDF]
arXiv, 2021 The problem of solving linear systems is one of the most fundamental problems in computer science, where given a satisfiable linear system $(A,b)$, for $A \in \mathbb{R}^{n \times n}$ and $b \in \mathbb{R}^n$, we wish to find a vector $x \in \mathbb{R}^n$ such that $Ax = b$.
arxiv
Integrable Discrete Linear Systems and One-Matrix Model [PDF]
Nucl.Phys.B375:453-477,1992, 1991 In this paper we analyze one-matrix models by means of the associated discrete linear systems. We see that the consistency conditions of the discrete linear system lead to the Virasoro constraints. The linear system is endowed with gauge invariances. We show that invariance under time-independent gauge transformations entails the integrability of the ...
arxiv +1 more source
Insertion of the FeB cofactor in cNORs lacking metal inserting chaperones
FEBS Letters, EarlyView.Nitric oxide reductase is an enzyme found in the bacterial denitrification pathway. The NOR active site contains a non‐heme iron, often, but not always inserted with the assistance of chaperones. Here, we study the insertion of FeB in the subfamily of cNORs lacking chaperones and found a putative channel, conserved in the family, perhaps enabling the ...
Sofia Appelgren, Pia Ädelroth
wiley +1 more source
An efficient variant of the greedy block Kaczmarz algorithm for solving large linear systems
AIMS MathematicsBy exploiting the concept of row partitioning, we propose an efficient variant of the greedy block Kaczmarz algorithm for solving consistent large linear systems. The number of blocks is determined a priori through numerical experiments.
Ke Zhang +2 more
doaj +1 more source
Special linear Systems on Toric Varieties [PDF]
arXiv, 2003 We consider linear systems on toric varieties of any dimension, with invariant base points, giving a characterization of special linear systems. We then make a new conjecture for linear systems on rational surfaces.
arxiv
Linear Invariants for Linear Systems
, 2021 A central question in verification is characterizing when a system has invariants of a certain form, and then synthesizing them. We say a system has a $k$ linear invariant, $k$-LI in short, if it has a conjunction of $k$ linear (non-strict) inequalities -- equivalently, an intersection of $k$ (closed) half spaces -- as an invariant.
openaire +2 more sources
FEBS Letters, EarlyView.LHCPs are transported to the thylakoid membrane via the (cp)SRP pathway. This process involves a transit complex of (cp)SRP43, (cp)SRP54 and LHCP, which interacts with (cp)FtsY and Alb3 at the membrane. GTP hydrolysis by (cp)SRP54 and (cp)FtsY triggers complex dissociation.
Victor Zegarra +7 more
wiley +1 more source
Singularity Excitations and Initial Value Problem in Continuous LTI Systems
IEEE Access, 2020 A modern challenge in electrical engineering education is to keep the math at a sufficient level, with a goal to find an optimal balance between calculus competence and operative skills needed for real-life technical applications. It is not uncommon that
Milan M. Ponjavic, Tomislav B. Sekara
doaj +1 more source
First integrals of ordinary linear differential systems [PDF]
arXiv, 2012 The spectral method for building first integrals of ordinary linear differential systems is elaborated. Using this method, we obtain bases of first integrals for linear differential systems with constant coefficients, for linear nonautonomous differential systems integrable in closed form (algebraic reducible systems, triangular systems, the Lappo ...
arxiv
Log-Linear Dynamical Systems [PDF]
arXiv, 2020 We present log-linear dynamical systems, a dynamical system model for positive quantities. We explain the connection to linear dynamical systems and show how convex optimization can be used to identify and control log-linear dynamical systems. We illustrate system identification and control with an example from predator-prey dynamics.
arxiv