Sciweavers

573 search results - page 48 / 115
» On Wiedemann's Method of Solving Sparse Linear Systems
Sort
View
JMIV
2007
98views more  JMIV 2007»
13 years 9 months ago
A Bilinear Approach to the Parameter Estimation of a General Heteroscedastic Linear System, with Application to Conic Fitting
: In this paper, we study the parameter estimation problem in a general heteroscedastic linear system, by putting the problem in the framework of the bilinear approach to low-rank ...
Pei Chen, David Suter
ICTIR
2009
Springer
14 years 3 months ago
PageRank: Splitting Homogeneous Singular Linear Systems of Index One
Abstract. The PageRank algorithm is used today within web information retrieval to provide a content-neutral ranking metric over web pages. It employs power method iterations to so...
Douglas V. de Jager, Jeremy T. Bradley
DAC
1989
ACM
14 years 19 days ago
An Efficient Finite Element Method for Submicron IC Capacitance Extraction
We present an accurate and efficient method for extraction of parasitic capacitances in submicron integrated circuits. The method uses a 3-D finite element model in which the cond...
N. P. van der Meijs, Arjan J. van Genderen
ICIP
2010
IEEE
14 years 2 months ago
Estimation of linear deformations of 3D objects
We propose a registration method to find affine transformations between 3D objects by constructing and solving an overdetermined system of polynomial equations. We utilize voxel...
Attila Tanács, Natasa Sladoje, Joakim Lindblad, a...
HPCN
1997
Springer
14 years 1 months ago
Parallel Solution of Irregular, Sparse Matrix Problems Using High Performance Fortran
For regular, sparse, linear systems, like those derived from regular grids, using High Performance Fortran (HPF) for iterative solvers is straightforward. However, for irregular ma...
Eric de Sturler, Damian Loher