Related papers: On the Cholesky method
We investigate the continuous analogue of the Cholesky factorization, namely the pivoted Cholesky algorithm. Our analysis establishes quantitative convergence guarantees for kernels of minimal smoothness. We prove that for a symmetric…
We consider the computation of quadrature rules that are exact for a Chebyshev set of linearly independent functions on an interval $[a,b]$. A general theory of Chebyshev sets guarantees the existence of rules with a Gaussian property, in…
Direct factorization methods for the solution of large, sparse linear systems that arise from PDE discretizations are robust, but typically show poor time and memory scalability for large systems. In this paper, we describe an efficient…
We present a continuous finite element method for some examples of fully nonlinear elliptic equation. A key tool is the discretisation proposed in Lakkis & Pryer (2011, SISC) allowing us to work directly on the strong form of a linear PDE.…
In this paper we describe an elimination process which is a deterministic rewriting procedure that on each elementary step transforms one system of equations over free groups into a finitely many new ones. Infinite branches of this process…
We propose a new algorithm for efficiently solving the damped Fisher matrix in large-scale scenarios where the number of parameters significantly exceeds the number of available samples. This problem is fundamental for natural gradient…
We consider exact matrix decomposition by Gauss-Bareiss reduction. We investigate two aspects of the process: common row and column factors and the influence of pivoting strategies. We identify two types of common factors: systematic and…
Decomposition techniques for linear programming are difficult to extend to conic optimization problems with general non-polyhedral convex cones because the conic inequalities introduce an additional nonlinear coupling between the variables.…
In this paper we prove the global convergence of the complex Jacobi method for Hermitian matrices for a large class of generalized serial pivot strategies. For a given Hermitian matrix $A$ of order $n$ we find a constant $\gamma<1$…
An iterative scheme for the Dynamical Systems Method (DSM) is given such that one does not have to solve the Cauchy problem occuring in the application of the DSM for solving ill-conditioned linear algebraic systems. The novelty of the…
An alternative, geometrical proof of a known theorem concerning the decomposition of positive maps of the matrix algebra $M_{2}(\mathbb{C})$ has been presented. The premise of the proof is the identification of positive maps with operators…
A system of linear integral equations is presented, which is the analog of the system of Marchenko integral equations, to solve the inverse scattering problem for the linear system associated with the derivative NLS equations. The…
The construction of the general solution sequence of row-finite linear systems is accomplished by implementing -ad infinitum- the Gauss-Jordan algorithm under a rightmost pivot elimination strategy. The algorithm generates a basis (finite…
We show that Csanky's fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LAP from the principle of linear independence. LAP is a natural…
We design an algorithm for control of a linear switched system by means of Geometric Algebra. More precisely, we develop a switching path searching algorithm for a two-dimensional linear dynamical switched system with non-singular matrix…
Generalizing the main result of [Aparicio-Monforte A., Compoint E., Weil J.-A., J. Pure Appl. Algebra 217 (2013), 1504-1516], we prove that a linear differential system is in reduced form in the sense of Kolchin and Kovacic if and only if…
In this paper we prove symmetry results for classical solutions of nonlinear cooperative elliptic systems in a ball or in annulus in $\RN$, $N \geq 2 $. More precisely we prove that solutions having Morse index $j \leq N $ are foliated…
We consider the formal reduction of a system of linear differential equations and show that, if the system can be block-diagonalised through transformation with a ramified Shearing-transformation and following application of the Splitting…
In order to extrincate the structure of corings with a finitely generated and projective generator we give the notion of a comatrix coring. As consequences we give generalizations of the main characterizations of faithfully flat Galois…
We introduce a new algorithm and software for solving linear equations in symmetric diagonally dominant matrices with non-positive off-diagonal entries (SDDM matrices), including Laplacian matrices. We use pre-conditioned conjugate gradient…