Triangular factors of modified matrices

From MaRDI portal
Publication:2395579

DOI10.1007/BF01436076zbMath0132.36204MaRDI QIDQ2395579

John M. Bennett

Publication date: 1965

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131654



Related Items

Factorized Variable Metric Methods for Unconstrained Optimization, Updating $LU$ Factorizations for Computing Stationary Distributions, On the local convergence of adjoint Broyden methods, A graph isomorphism algorithm using pseudoinverses, Recent advances in unconstrained optimization, Computational methods of linear algebra, Fast Factorization Update for General Elliptic Equations Under Multiple Coefficient Updates, Methods for Modifying Matrix Factorizations, Updating the principal angle decomposition, The Convergence of an Algorithm for Solving Sparse Nonlinear Systems, Pivoting strategy for rank-one modification of \(LDM^ t\)-like factorization, Partitioning, tearing and modification of sparse linear systems, Sparse matrix factor modification in structural reanalysis, Product-form Cholesky factorization in interior point methods for second-order cone programming, AN EXACT STRUCTURAL STATIC REANALYSIS METHOD, Global convergence of quasi-Newton methods based on adjoint Broyden updates, Generation of orthogonal rational functions by procedures for structured matrices, A numerically stable form of the simplex algorithm, A modified layered-step interior-point algorithm for linear programming, Modifications and implementation of the ellipsoid algorithm for linear programming, A physical interpretation of factorization and factor modification in structural analysis, A quasi-Newton method with sparse triple factorization for unconstrained minimization, Basic-set algorithm for a generalized linear complementarity problem, Stable modification of explicitLU factors for simplex updates



Cites Work