The Null Space Problem I. Complexity
From MaRDI portal
Publication:3747622
DOI10.1137/0607059zbMath0608.65024OpenAlexW1967717294MaRDI QIDQ3747622
Thomas F. Coleman, Alex Pothen
Publication date: 1986
Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0607059
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, An efficient graph‐theoretical force method for three‐dimensional finite element analysis, Isogeometric analysis with strong multipatch \(C^{1}\)-coupling, Matrix sparsification and the sparse null space problem, Sparsity and Nullity: Paradigms for Analysis Dictionary Learning, The derivation of minimal support basis functions for the discrete divergence operator, 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, On the computation of multi-dimensional solution manifolds of parametrized equations, Using monodromy to recover symmetries of polynomial systems, Computing a Sparse Basis for the Null Space, An efficient algorithm for sparse null space basis problem using ABS methods, Canonical bases in linear programming, The Null Space Problem II. Algorithms, Unnamed Item, Analysis of frames by substructuring technique based on using algebraic and graph methods, Computing the null space of finite element problems, Exact Recovery of Multichannel Sparse Blind Deconvolution via Gradient Descent, 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, Finding a low-rank basis in a matrix subspace, A globally and quadratically convergent affine scaling method for linear \(l_ 1\) problems, Structural variation theorems extended to integrated force method for the analysis of skeletal structures, An efficient graph theoretical method for plate bending finite element analysis via force method, Inference of chemical reaction networks based on concentration profiles using an optimization framework, On privacy preserving data release of linear dynamic networks, Efficient graph-theoretical force method for two-dimensional rectangular finite element analysis, Theory of functional connections applied to quadratic and nonlinear programming under equality constraints, U-splines: splines over unstructured meshes, Solving large linear least squares problems with linear equality constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Large sparse numerical optimization
- An algorithm to compute a sparse basis of the null space
- Decomposition of regular matroids
- Algorithms for Generating Fundamental Cycles in a Graph
- Finding a Minimum Circuit in a Graph
- Modules unimodulaires
- The NP-completeness column: An ongoing guide
