Triangular factors of modified matrices
From MaRDI portal
Publication:2395579
Cites work
Cited in
(25)- Sparse matrix factor modification in structural reanalysis
- On the local convergence of adjoint Broyden methods
- Global convergence of quasi-Newton methods based on adjoint Broyden updates
- Modifications and implementation of the ellipsoid algorithm for linear programming
- Recent advances in unconstrained optimization
- Generation of orthogonal rational functions by procedures for structured matrices
- Computational methods of linear algebra
- Updating $LU$ Factorizations for Computing Stationary Distributions
- Basic-set algorithm for a generalized linear complementarity problem
- The Convergence of an Algorithm for Solving Sparse Nonlinear Systems
- Stable modification of explicitLU factors for simplex updates
- Product-form Cholesky factorization in interior point methods for second-order cone programming
- Algorithm 1030: SC-SR1: MATLAB software for limited-memory SR1 trust-region methods
- A graph isomorphism algorithm using pseudoinverses
- Methods for Modifying Matrix Factorizations
- A numerically stable form of the simplex algorithm
- Partitioning, tearing and modification of sparse linear systems
- Fast Factorization Update for General Elliptic Equations Under Multiple Coefficient Updates
- Pivoting strategy for rank-one modification of \(LDM^ t\)-like factorization
- Factorized Variable Metric Methods for Unconstrained Optimization
- A physical interpretation of factorization and factor modification in structural analysis
- A quasi-Newton method with sparse triple factorization for unconstrained minimization
- Updating the principal angle decomposition
- A modified layered-step interior-point algorithm for linear programming
- AN EXACT STRUCTURAL STATIC REANALYSIS METHOD
This page was built for publication: Triangular factors of modified matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2395579)