The Null Space Problem I. Complexity
From MaRDI portal
Recommendations
- The Null Space Problem II. Algorithms
- scientific article; zbMATH DE number 865572
- On the complexity of the real Nullstellensatz in the 0-dimensional case
- THE A-COMPLEXITY OF A SPACE
- Complexity of Ramsey null sets
- Complexity of Null- and Positivstellensatz proofs
- On the intrinsic complexity of the arithmetic Nullstellensatz
- Complexity of fixed points. I
- scientific article; zbMATH DE number 1258313
- Complete problems for space bounded subclasses of NP
Cites work
- Algorithms for Generating Fundamental Cycles in a Graph
- An algorithm to compute a sparse basis of the null space
- Decomposition of regular matroids
- Finding a Minimum Circuit in a Graph
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 3905737 (Why is no real title available?)
- scientific article; zbMATH DE number 3949599 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3793774 (Why is no real title available?)
- scientific article; zbMATH DE number 3243268 (Why is no real title available?)
- scientific article; zbMATH DE number 3290885 (Why is no real title available?)
- scientific article; zbMATH DE number 3365043 (Why is no real title available?)
- Large sparse numerical optimization
- Modules unimodulaires
- The NP-completeness column: An ongoing guide
Cited in
(42)- The w\(\Delta\)-space problem
- Sparse null basis computations in structural optimization
- On the computation of multi-dimensional solution manifolds of parametrized equations
- 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
- A constrained least-squares approach to the rapid reanalysis of structures
- A greedy algorithm for the optimal basis problem
- Isogeometric analysis with strong multipatch \(C^{1}\)-coupling
- A \(\{-1,0,1\}\)- and sparsest basis for the null space of a forest in optimal time
- The derivation of minimal support basis functions for the discrete divergence operator
- An efficient algorithm for sparse null space basis problem using ABS methods
- Computing the spark: mixed-integer programming for the (vector) matroid girth problem
- 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
- A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block
- On privacy preserving data release of linear dynamic networks
- Construction of a discrete divergence-free basis through orthogonal factorization in \({\mathcal{H}}\)-arithmetic
- Sparsity and nullity: paradigms for analysis dictionary learning
- Efficient graph-theoretical force method for two-dimensional rectangular finite element analysis
- Analysis of frames by substructuring technique based on using algebraic and graph methods
- Structural variation theorems extended to integrated force method for the analysis of skeletal structures
- Efficient finite element analysis of models comprised of higher order triangular elements
- Computing a Sparse Basis for the Null Space
- The Null Space Problem II. Algorithms
- The Sparse Basis Problem and Multilinear Algebra
- Exact Recovery of Multichannel Sparse Blind Deconvolution via Gradient Descent
- Damage identification of truss structures based on force method
- Finding a low-rank basis in a matrix subspace
- 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
- An efficient graph‐theoretical force method for three‐dimensional finite element analysis
- Using monodromy to recover symmetries of polynomial systems
- scientific article; zbMATH DE number 7692356 (Why is no real title available?)
- An efficient algorithm for the minimal least squares solution of linear systems with indefinite symmetric matrices
- Computing the null space of finite element problems
- 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
- Rank-modulation codes for DNA storage in shotgun sequencing: structure and distance properties
- Space-time isomorphism problem is intractable (NP-hard)
- A new four-node quadrilateral plate bending element for highly sparse and banded flexibility matrices
- Canonical bases in linear programming
This page was built for publication: The Null Space Problem I. Complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3747622)
