Two Iterative Algorithms for Solving Systems of Simultaneous Linear Algebraic Equations with Real Matrices of Coefficients
A. S. Kondratiev, N. P. Polishchuk
Abstract
The paper describes two iterative algorithms for solving general systems of M simultaneous linear algebraic equations (SLAE) with real matrices of coefficients. The system can be determined, underdetermined, and overdetermined. Linearly dependent equations are also allowed. Both algorithms use the method of Lagrange multipliers to transform the original SLAE into a positively determined function F of real original variables X(i) (i=1,...,N) and Lagrange multipliers Lambda(i) (i=1,...,M). Function F is differentiated with respect to variables X(i) and the obtained relationships are used to express F in terms of Lagrange multipliers Lambda(i). The obtained function is minimized with respect to variables Lambda(i) with the help of one of two the following minimization techniques: (1) relaxation method or (2) method of conjugate gradients by Fletcher and Reeves. Numerical examples are given.
Create a lesson
Related papers
Convergence analysis of TriCG and TriMR for symmetric quasi-definite linear systems
Kui Du, Jia-Jun Fan
Adaptive data-driven reduced-order models for reciprocal MIMO port-Hamiltonian dynamical systems
Anarzhan Abilgazy, Mikhail Zaslavsky
Fixed-grid schemes for fractional moving-boundary problems
Conrard Giresse Tetsassi Feugmo
Initial-Trace Insufficiency and Entropy-Accounting Separation in Finite-Volume Coarse Graining
Antonis Polemitis, Nicholas Christakis, Dimitris Drikakis
A probabilistic score estimation using the Bismut--Elworthy--Li formula
Jiatong Sun, Long Nguyen, Ning Jiang et al.
Weighted Randomized Kaczmarz for Sparsely Corrupted Linear Systems
Jessie Chen, Ziyu Cheng, Yunhui He et al.