The Null Space Problem II. Algorithms
From MaRDI portal
Recommendations
- The Null Space Problem I. Complexity
- A fast randomized algorithm for computing an approximate null space
- An efficient algorithm for computing the generalized null space decomposition
- scientific article; zbMATH DE number 1567905
- An algorithm to compute a sparse basis of the null space
- On space-efficient algorithms for certain NP-complete problems
- A null space approach for solving nonlinear complementarity problems
- An entire space polynomial-time algorithm for linear programming
- Some algorithms for solving optimization problems in Hilbert spaces
- A new algorithm for solving the split common null point problem in Hilbert spaces
Cites work
- A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
- A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
- Algorithms for Generating Fundamental Cycles in a Graph
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- An algorithm to compute a sparse basis of the null space
- Computing a Sparse Basis for the Null Space
- Estimation of sparse hessian matrices and graph coloring problems
- Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
- Graph theory with applications
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 3816913 (Why is no real title available?)
- scientific article; zbMATH DE number 3825556 (Why is no real title available?)
- scientific article; zbMATH DE number 3949599 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 3793774 (Why is no real title available?)
- On computational procedures for the force method
- Optimization of unconstrained functions with sparse hessian matrices-newton-type methods
- Predicting fill for sparse orthogonal factorization
- The Null Space Problem I. Complexity
- Two Remarks on the Mendelsohn-Dulmage Theorem
Cited in
(50)- Rank and null space calculations using matrix decomposition without column interchanges
- Sparse null basis computations in structural optimization
- Construction of null bases for the divergence operator associated with incompressible Navier-Stokes equations
- A globally and quadratically convergent affine scaling method for linear \(l_ 1\) problems
- Separators and structure prediction in sparse orthogonal factorization
- A constrained least-squares approach to the rapid reanalysis of structures
- A greedy algorithm for the optimal basis problem
- Null space algorithm and spanning trees in solving Darcy's equation
- A \(\{-1,0,1\}\)- and sparsest basis for the null space of a forest in optimal time
- A new class of preconditioners for large-scale linear systems from interior point methods for linear programming
- Combinatorial characterization of the null spaces of symmetric H-matrices
- The derivation of minimal support basis functions for the discrete divergence operator
- An efficient algorithm for sparse null space basis problem using ABS methods
- A \(2/3\)-approximation algorithm for vertex-weighted matching
- Theory of functional connections applied to quadratic and nonlinear programming under equality constraints
- U-splines: splines over unstructured meshes
- A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block
- Construction of a discrete divergence-free basis through orthogonal factorization in \({\mathcal{H}}\)-arithmetic
- Continuous numerical solutions for a base of null space of matrix functions whose ranks are not full
- On computing minimal proper nullspace bases with applications in fault detection
- Sparsity and nullity: paradigms for analysis dictionary learning
- A note on the computation of an orthonormal basis for the null space of a matrix
- scientific article; zbMATH DE number 3873080 (Why is no real title available?)
- On exact algorithm of the method of basic matrices
- On the Computation of Null Spaces of Sparse Rectangular Matrices
- Efficient finite element analysis of models comprised of higher order triangular elements
- Properties of a representation of a basis for the null space
- scientific article; zbMATH DE number 3949599 (Why is no real title available?)
- The Null Space Problem I. Complexity
- Computing a Sparse Basis for the Null Space
- scientific article; zbMATH DE number 706824 (Why is no real title available?)
- Nullspaces of matrices and their compounds
- The Sparse Basis Problem and Multilinear Algebra
- A 2/3-approximation algorithm for vertex weighted matching in bipartite graphs
- On Positive Semidefinite Matrices with Known Null Space
- An application of the Dulmage-Mendelsohn decomposition to sparse null space bases of full row rank matrices
- Damage identification of truss structures based on force method
- An efficient graph theoretical method for plate bending finite element analysis via force method
- Approximation algorithms in combinatorial scientific computing
- Recursive Algorithms to Update a Numerical Basis Matrix of the Null Space of the Block Row, (Banded) Block Toeplitz, and Block Macaulay Matrix
- An orthogonal self-stress matrix for efficient analysis of cyclically symmetric space truss structures via force method
- A fast randomized algorithm for computing an approximate null space
- Cardinality minimization, constraints, and regularization: a survey
- Efficient finite element analysis using graph-theoretical force method; rectangular plane stress and plane strain Lagrange family elements
- An algorithm to compute a sparse basis of the null space
- Iterative solution of Navier-Stokes dual variable difference equations
- The dual variable method for solving fluid flow difference equations on Delaunay triangulations
- A new four-node quadrilateral plate bending element for highly sparse and banded flexibility matrices
- Combinatorial algorithms for computing column space bases that have sparse inverses
- Block computation and representation of a sparse nullspace basis of a rectangular matrix
This page was built for publication: The Null Space Problem II. Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3783422)
