Pages that link to "Item:Q3783422"

The following pages link to The Null Space Problem II. Algorithms (Q3783422):

Displaying 37 items.

• Matrix sparsification and the sparse null space problem (Q329287) (← links)
• Efficient finite element analysis of models comprised of higher order triangular elements (Q368172) (← links)
• An orthogonal self-stress matrix for efficient analysis of cyclically symmetric space truss structures via force method (Q615783) (← links)
• Efficient finite element analysis using graph-theoretical force method; rectangular plane stress and plane strain Lagrange family elements (Q669335) (← links)
• An algorithm to compute a sparse basis of the null space (Q799342) (← links)
• Iterative solution of Navier-Stokes dual variable difference equations (Q802976) (← links)
• The dual variable method for solving fluid flow difference equations on Delaunay triangulations (Q806478) (← links)
• A new four-node quadrilateral plate bending element for highly sparse and banded flexibility matrices (Q846100) (← links)
• Combinatorial algorithms for computing column space bases that have sparse inverses (Q871171) (← links)
• Block computation and representation of a sparse nullspace basis of a rectangular matrix (Q924318) (← links)
• Rank and null space calculations using matrix decomposition without column interchanges (Q1074304) (← links)
• Sparse null basis computations in structural optimization (Q1115103) (← links)
• Construction of null bases for the divergence operator associated with incompressible Navier-Stokes equations (Q1188416) (← links)
• A globally and quadratically convergent affine scaling method for linear \(l_ 1\) problems (Q1199751) (← links)
• Separators and structure prediction in sparse orthogonal factorization (Q1361831) (← links)
• A constrained least-squares approach to the rapid reanalysis of structures (Q1369356) (← links)
• A greedy algorithm for the optimal basis problem (Q1371665) (← links)
• Null space algorithm and spanning trees in solving Darcy's equation (Q1431636) (← links)
• A \(\{-1,0,1\}\)- and sparsest basis for the null space of a forest in optimal time (Q1747105) (← links)
• A new class of preconditioners for large-scale linear systems from interior point methods for linear programming (Q1765884) (← links)
• Combinatorial characterization of the null spaces of symmetric H-matrices (Q1887495) (← links)
• The derivation of minimal support basis functions for the discrete divergence operator (Q1903654) (← links)
• An efficient algorithm for sparse null space basis problem using ABS methods (Q1944750) (← links)
• A \(2/3\)-approximation algorithm for vertex-weighted matching (Q2064284) (← links)
• Theory of functional connections applied to quadratic and nonlinear programming under equality constraints (Q2074867) (← links)
• U-splines: splines over unstructured meshes (Q2096809) (← links)
• A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block (Q2159428) (← links)
• Construction of a discrete divergence-free basis through orthogonal factorization in \({\mathcal{H}}\)-arithmetic (Q2471830) (← links)
• Continuous numerical solutions for a base of null space of matrix functions whose ranks are not full (Q2720850) (← links)
• Sparsity and Nullity: Paradigms for Analysis Dictionary Learning (Q3188221) (← links)
• The Null Space Problem I. Complexity (Q3747622) (← links)
• A 2/3-Approximation Algorithm for Vertex Weighted Matching in Bipartite Graphs (Q4623143) (← links)
• Damage Identification of Truss Structures Based on Force Method (Q5153196) (← links)
• An efficient graph theoretical method for plate bending finite element analysis via force method (Q5190551) (← links)
• Approximation algorithms in combinatorial scientific computing (Q5230524) (← links)
• A fast randomized algorithm for computing an approximate null space (Q6161581) (← links)
• Cardinality minimization, constraints, and regularization: a survey (Q6585278) (← links)