Sciweavers

417 search results - page 19 / 84
» Fast Methods for Solving Linear Diophantine Equations
Sort
View
CORR
1998
Springer
105views Education» more  CORR 1998»
13 years 8 months ago
Solving Degenerate Sparse Polynomial Systems Faster
Abstract. Consider a system F of n polynomial equations in n unknowns, over an algebraically closed field of arbitrary characteristic. We present a fast method to find a point in...
J. Maurice Rojas
SIAMSC
2011
126views more  SIAMSC 2011»
13 years 3 months ago
Fast Structured AMG Preconditioning for the Bidomain Model in Electrocardiology
The electrical activity of the heart may be modeled by a non-linear system of partial differential equations known as the bidomain model. Due to the rapid variations in the electr...
Micol Pennacchio, Valeria Simoncini
CORR
2010
Springer
61views Education» more  CORR 2010»
13 years 8 months ago
A weakly stable algorithm for general Toeplitz systems
We show that a fast algorithm for the QR factorization of a Toeplitz or Hankel matrix A is weakly stable in the sense that RT R is close to AT A. Thus, when the algorithm is used ...
Adam W. Bojanczyk, Richard P. Brent, Frank R. de H...
SIAMSC
2010
157views more  SIAMSC 2010»
13 years 7 months ago
Certified Reduced Basis Methods and Output Bounds for the Harmonic Maxwell's Equations
We propose certified reduced basis methods for the efficient and reliable evaluation of a general output that is implicitly connected to a given parameterized input through the ha...
Yanlai Chen, Jan S. Hesthaven, Yvon Maday, Jer&oac...
SIAMSC
2010
143views more  SIAMSC 2010»
13 years 7 months ago
Computing and Deflating Eigenvalues While Solving Multiple Right-Hand Side Linear Systems with an Application to Quantum Chromod
Abstract. We present a new algorithm that computes eigenvalues and eigenvectors of a Hermitian positive definite matrix while solving a linear system of equations with Conjugate G...
Andreas Stathopoulos, Konstantinos Orginos