719 search results - page 13 / 144 » Solving Sparse Linear Constraints |
102
click to vote
HPCC
2007
Springer
15 years 2 months ago
2007
Springer
A wide class of geometry processing and PDE resolution methods needs to solve a linear system, where the non-zero pattern of the matrix is dictated by the connectivity matrix of th...
103
click to vote
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
This paper studies the problem of simultaneously aligning a batch of linearly correlated images despite gross corruption (such as occlusion). Our method seeks an optimal set of im...
MOC
1998
14 years 10 months ago
1998
Abstract. This paper shows that there is a close relationship between the Euclidean algorithm for polynomials and the Lanczos method for solving sparse linear systems, especially w...
CORR
2011
Springer
14 years 5 months ago
2011
Springer
We propose and analyze an extremely fast, efficient and simple method for solving the problem: min{ u 1 :Au=f,u∈Rn }. This method was first described in [1], with more details i...
89
Voted
CSC
2006
14 years 11 months ago
2006
- Two software packages for solving sparse systems of linear equations, SuperLU and UMFPACK, have been integrated with the University of Maine Ice Sheet Model for predicting the fo...