A class of direct methods for linear systems
From MaRDI portal
A new class of methods is proposed for solving general (determined or underdetermined, full rank or rank deficient) linear algebraic systems. The class is of direct type methods, the solution being found in a number of steps no larger than the number of equations. The class contains free parameters, say an initial matrix and two vectors to be chosen at each step. A general factorization of the coefficient matrix is implicitly performed by the algorithm and there exist parameter choices implicitly generating orthogonal, LU and Cholesky type factorizations. Computational experiments indicate that some algorithms in this class outperform in accuracy well-known classical methods on some very ill-conditioned problems.
Recommendations
Cites work
- A bound to the condition number of canonical rank-two corrections and applications to the variable metric method
- A class of direct methods for linear systems
- A class of scaled direct methods for linear systems
- A direct method for the general solution of a system of linear equations
- A Quadratically Convergent Newton-Like Method Based Upon Gaussian Elimination
- Conjugate direction methods for solving systems of linear equations
- Generalization of the Methods of Brent and Brown for Solving Nonlinear Simultaneous Equations
- scientific article; zbMATH DE number 3898114 (Why is no real title available?)
- scientific article; zbMATH DE number 3511872 (Why is no real title available?)
- On the Davidenko-Branin Method for Solving Simultaneous Nonlinear Equations
- Terminating and Nonterminating Iterations for Solving Linear Systems
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- The Lanczos Biorthogonalization Algorithm and Other Oblique Projection Methods for Solving Large Unsymmetric Systems
- Unconstrained optimization based on homogeneous models
Cited in
(72)- A ABS algorithm for solving singular nonlinear system with space transformation
- An ABS algorithm for a class of systems of stochastic linear equations
- Integer extended ABS algorithms and possible control of intermediate results for linear Diophantine systems
- Direct methods for the solution of linear systems
- The local convergence of ABS methods for nonlinear algebraic equations
- A strict bound to the condition number of bordered positive definite matrices
- Superlinear convergence theorem in the ABSg class of algorithms for nonlinear algebraic equations
- Numerical experiments with ABS algorithms for linear systems on a parallel machine
- Variationally derived algorithms in the ABS class for linear systems
- Solving sparse linear systems by an ABS-method that corresponds to LU- decomposition
- Analysis of error propagation in the ABS class for linear systems
- Optimally conditioned scaled ABS algorithms for linear systems
- Perturbations of M-matrices via ABS methods and their applications to input-output analysis
- Convergence analysis of the nonlinear block scaled ABS methods
- New interpretation of related Huang's methods
- An ABS algorithm for solving singular nonlinear systems with rank defects.
- Direct methods of solving systems of linear algebraic equations with complex \(\lambda\)-matrices
- ABS algorithms for linear equations and optimization
- ABS algorithms for Diophantine linear equations and integer LP problems
- Solution of linear least squares via the ABS algorithm
- Solving linear least squares by orthogonal factorization and pseudoinverse computation via the modified Huang algorithm in the ABS class
- An efficient algorithm for sparse null space basis problem using ABS methods
- General solution of full row rank linear systems of equations using a new compression ABS model
- Numerical analysis of parallel implementation of the reorthogonalized ABS methods
- Diophantine quadratic equation and Smith normal form using scaled extended integer Abaffy-Broyden-Spedicato algorithms
- Extended rank reduction formulas containing Wedderburn and Abaffy-Broyden-Spedicato rank reducing processes
- A method for solving the system of linear equations and linear inequalities
- An two phase ABS method for solving over-determined systems of linear inequalities
- Rank reduction, factorization and conjugation
- Extended integer rank reduction formulas and Smith normal form
- Solving rank one perturbed linear Diophantine systems by the ABS method
- Real and integer Wedderburn rank reduction formulas for matrix decompositions
- Real and integer extended rank reduction formulas and matrix decompositions: A review
- scientific article; zbMATH DE number 4135299 (Why is no real title available?)
- An algorithm for solving determined or undetermined, pull or deficient rank linear systems based upon the optimally conditioned ABS algorithm
- A handy proof of Gay's theorem
- A direct method for solving linear systems
- Least change properties of ABS methods and their application in secant-type updates
- On the application of the ABS algorithm to linear programming and linear complementarity
- On the ABS algorithm with singular initial matrix and its application to linear programming
- A bibliography of the ABS methods
- A FAST conic method for function minimization
- Solving rank one revised linear systems by the scaled ABS method
- ABS-type methods for solving full row rank linear systems using a new rank two update
- A code for linear least squares based upon the ABS procedure
- Numerical experiments with the symmetric algorithm in the ABS class for linear systems
- On the abs algorithms for perturbed linear systems∗
- scientific article; zbMATH DE number 892208 (Why is no real title available?)
- Nonnil-Noetherian modules over commutative rings
- A generalization of the ABS algorithms and its application to some special real and integer matrix factorizations
- On generalized Schur complement of matrices and its applications to real and integer matrix factorizations
- A global Jacobian smoothing algorithm for nonlinear complementarity problems
- Note on new solutions of \(LR\) fuzzy linear systems using ranking functions and ABS algorithms
- Comments on "Fast direct solution of method of moments linear system
- A homogeneous method for unconstrained optimization
- New solutions of LR fuzzy linear systems using ranking functions and ABS algorithms
- Weakly prime and super-max filters in BL-algebras
- Generalized \(\pi\)-Baer \(\ast\)-rings
- The rank reduction procedure of Egerváry
- ABS methods for continuous and integer linear equations and optimization
- On Kaczmarz's projection iteration as a direct solver for linear least squares problems
- Restart row update ABS methods for solving systems of nonlinear equations
- Variations on the Gram--Schmidt and the Huang algorithms for linear systems: A numerical study
- A class of scaled direct methods for linear systems
- Rank reduction processes for solving linear Diophantine systems and integer factorizations: a review
- A class of direct methods for linear systems
- General scheme for solving linear algebraic problems by direct methods
- Multi-step nonlinear ABS methods and their efficiency analysis
- A Sherman-Morrison approach to the solution of linear systems
- Extended reduced rank two Abaffian update schemes in the ABS-type methods
- On solving sparse band systems with three algorithms of the ABS family
- On the numerical stability of Huang's update
This page was built for publication: A class of direct methods for linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q791273)
