A class of direct methods for linear systems
From MaRDI portal
Publication:791273
DOI10.1007/BF01391414zbMath0535.65009OpenAlexW1977211467MaRDI QIDQ791273
Jozsef Abaffy, Emilio Spedicato, Charles Broyden
Publication date: 1984
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/132973
computational complexityill-conditioned problemsCholesky factorizationsfactorization methodsComputational experiments
Related Items
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, Real and integer Wedderburn rank reduction formulas for matrix decompositions, Real and Integer Extended Rank Reduction Formulas and Matrix Decompositions: A Review, Variationally derived algorithms in the ABS class for linear systems, Solving sparse linear systems by an ABS-method that corresponds to LU- decomposition, Extended reduced rank two Abaffian update schemes in the ABS-type methods, New interpretation of related Huang's methods, An algorithm for solving determined or undetermined, pull or deficient rank linear systems based upon the optimally conditioned ABS algorithm, Un algoritmo global con jacobiano suavizado para problemas de complementariedad no lineal, New solutions of LR fuzzy linear systems using ranking functions and ABS algorithms, Numerical analysis of parallel implementation of the reorthogonalized ABS methods, The rank reduction procedure of Egerváry, ABS methods for continuous and integer linear equations and optimization, Diophantine quadratic equation and Smith normal form using scaled extended integer Abaffy-Broyden-Spedicato algorithms, An efficient algorithm for sparse null space basis problem using ABS methods, Extended rank reduction formulas containing Wedderburn and Abaffy-Broyden-Spedicato rank reducing processes, On solving sparse band systems with three algorithms of the ABS family, Unnamed Item, Unnamed Item, On Kaczmarz's projection iteration as a direct solver for linear least squares problems, On the numerical stability of Huang's update, A generalization of the ABS algorithms and its application to some special real and integer matrix factorizations, A homogeneous method for unconstrained optimization, An ABS algorithm for solving singular nonlinear systems with rank defects., On generalized Schur complement of matrices and its applications to real and integer matrix factorizations, A method for solving the system of linear equations and linear inequalities, 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, General solution of full row rank linear systems of equations using a new compression ABS model, Solving rank one revised linear systems by the scaled ABS method, 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, Analysis of error propagation in the ABS class for linear systems, ABS-type methods for solving full row rank linear systems using a new rank two update, Rank reduction, factorization and conjugation, ABS algorithms for Diophantine linear equations and integer LP problems, A handy proof of Gay's theorem, An two phase ABS method for solving over-determined systems of linear inequalities, Solution of linear least squares via the ABS algorithm, Note on New Solutions of LR Fuzzy Linear Systems Using Ranking Functions and ABS Algorithms, Optimally conditioned scaled ABS algorithms for linear systems, A class of scaled direct methods for linear systems, A code for linear least squares based upon the ABS procedure, A FAST conic method for function minimization, Solving linear least squares by orthogonal factorization and pseudoinverse computation via the modified Huang algorithm in the ABS class, Numerical experiments with the symmetric algorithm in the ABS class for linear systems, A ABS algorithm for solving singular nonlinear system with space transformation, An ABS algorithm for a class of systems of stochastic linear equations, On the abs algorithms for perturbed linear systems∗, Integer extended ABS algorithms and possible control of intermediate results for linear Diophantine systems, Rank reduction processes for solving linear Diophantine systems and integer factorizations: a review, Perturbations of \(M\)-matrices via ABS methods and their applications to input-output analysis, Solving rank one perturbed linear Diophantine systems by the ABS method, A class of direct methods for linear systems, ABS algorithms for linear equations and optimization, Multi-step nonlinear ABS methods and their efficiency analysis, Extended integer rank reduction formulas and Smith normal form, NONNIL-NOETHERIAN MODULES OVER COMMUTATIVE RINGS, Convergence analysis of the nonlinear block scaled ABS methods
Cites Work
- Unnamed Item
- Unnamed Item
- A class of scaled direct methods for linear systems
- A class of direct methods for linear systems
- A direct method for the general solution of a system of linear equations
- A bound to the condition number of canonical rank-two corrections and applications to the variable metric method
- Conjugate direction methods for solving systems of linear equations
- Terminating and Nonterminating Iterations for Solving Linear Systems
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- Generalization of the Methods of Brent and Brown for Solving Nonlinear Simultaneous Equations
- The Lanczos Biorthogonalization Algorithm and Other Oblique Projection Methods for Solving Large Unsymmetric Systems
- On the Davidenko-Branin Method for Solving Simultaneous Nonlinear Equations
- Unconstrained optimization based on homogeneous models
- A Quadratically Convergent Newton-Like Method Based Upon Gaussian Elimination