Sciweavers

149 search results - page 4 / 30
» Solving Very Sparse Rational Systems of Equations
Sort
View
AMC
2005
87views more  AMC 2005»
13 years 7 months ago
Wavelet based preconditioners for sparse linear systems
A class of efficient preconditioners based on Daubechies family of wavelets for sparse, unsymmetric linear systems that arise in numerical solution of Partial Differential Equatio...
B. V. Rathish Kumar, Mani Mehra
ASAP
2008
IEEE
199views Hardware» more  ASAP 2008»
13 years 9 months ago
An efficient method for evaluating polynomial and rational function approximations
In this paper we extend the domain of applicability of the E-method [7, 8], as a hardware-oriented method for evaluating elementary functions using polynomial and rational functio...
Nicolas Brisebarre, Sylvain Chevillard, Milos D. E...
SIAMSC
2011
151views more  SIAMSC 2011»
13 years 2 months ago
Inexact Newton Methods with Restricted Additive Schwarz Based Nonlinear Elimination for Problems with High Local Nonlinearity
The classical inexact Newton algorithm is an efficient and popular technique for solving large sparse nonlinear system of equations. When the nonlinearities in the system are wellb...
Xiao-Chuan Cai, Xuefeng Li
ACPC
1999
Springer
13 years 11 months ago
Non-standard Parallel Solution Strategies for Distributed Sparse Linear Systems
Abstract. A number of techniques are described for solving sparse linear systems on parallel platforms. The general approach used is a domaindecomposition type method in which a pr...
Yousef Saad, Masha Sosonkina
SIAMJO
2008
108views more  SIAMJO 2008»
13 years 7 months ago
Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
This paper discusses how to find the global minimum of functions that are summations of small polynomials ("small" means involving a small number of variables). Some spa...
Jiawang Nie, James Demmel