The Null Space Problem II. Algorithms
From MaRDI portal
Publication:3783422
DOI10.1137/0608045zbMath0642.65028OpenAlexW1990025588MaRDI QIDQ3783422
Alex Pothen, Thomas F. Coleman
Publication date: 1987
Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/1813/6587
Computational methods for sparse matrices (65F50) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)
Related Items
A new four-node quadrilateral plate bending element for highly sparse and banded flexibility matrices, Sparsity and Nullity: Paradigms for Analysis Dictionary Learning, The derivation of minimal support basis functions for the discrete divergence operator, Separators and structure prediction in sparse orthogonal factorization, A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block, A constrained least-squares approach to the rapid reanalysis of structures, Sparse null basis computations in structural optimization, Efficient finite element analysis of models comprised of higher order triangular elements, An orthogonal self-stress matrix for efficient analysis of cyclically symmetric space truss structures via force method, An efficient algorithm for sparse null space basis problem using ABS methods, A 2/3-Approximation Algorithm for Vertex Weighted Matching in Bipartite Graphs, Efficient finite element analysis using graph-theoretical force method; rectangular plane stress and plane strain Lagrange family elements, Construction of null bases for the divergence operator associated with incompressible Navier-Stokes equations, Damage Identification of Truss Structures Based on Force Method, A \(\{-1,0,1\}\)- and sparsest basis for the null space of a forest in optimal time, Construction of a discrete divergence-free basis through orthogonal factorization in \({\mathcal{H}}\)-arithmetic, A globally and quadratically convergent affine scaling method for linear \(l_ 1\) problems, A new class of preconditioners for large-scale linear systems from interior point methods for linear programming, An efficient graph theoretical method for plate bending finite element analysis via force method, A \(2/3\)-approximation algorithm for vertex-weighted matching, Approximation algorithms in combinatorial scientific computing, Theory of functional connections applied to quadratic and nonlinear programming under equality constraints, U-splines: splines over unstructured meshes, Iterative solution of Navier-Stokes dual variable difference equations, The dual variable method for solving fluid flow difference equations on Delaunay triangulations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An algorithm to compute a sparse basis of the null space
- Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
- Optimization of unconstrained functions with sparse hessian matrices-newton-type methods
- On computational procedures for the force method
- Estimation of sparse hessian matrices and graph coloring problems
- The Null Space Problem I. Complexity
- A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
- Predicting fill for sparse orthogonal factorization
- Computing a Sparse Basis for the Null Space
- Algorithms for Generating Fundamental Cycles in a Graph
- A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
- Two Remarks on the Mendelsohn-Dulmage Theorem
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
