Sciweavers

417 search results - page 17 / 84
» Fast Methods for Solving Linear Diophantine Equations
Sort
View
SIAMSC
2008
134views more  SIAMSC 2008»
15 years 2 months ago
Efficient Solution of Anisotropic Lattice Equations by the Recovery Method
In a recent paper, the authors introduced the recovery method resp. local energy matching principle for solving large systems of lattice equations. The idea is to construct a part...
Ivo Babuska, S. A. Sauter
TSP
2010
14 years 10 months ago
Methods for sparse signal recovery using Kalman filtering with embedded pseudo-measurement norms and quasi-norms
We present two simple methods for recovering sparse signals from a series of noisy observations. The theory of compressed sensing (CS) requires solving a convex constrained minimiz...
Avishy Carmi, Pini Gurfil, Dimitri Kanevsky
SIAMNUM
2010
115views more  SIAMNUM 2010»
14 years 10 months ago
Superconvergence of Discontinuous Galerkin and Local Discontinuous Galerkin Schemes for Linear Hyperbolic and Convection-Diffusi
In this paper, we study the superconvergence property for the discontinuous Galerkin (DG) and the local discontinuous Galerkin (LDG) methods, for solving one-dimensional time depe...
Yingda Cheng, Chi-Wang Shu
122
Voted
JSC
2010
155views more  JSC 2010»
15 years 1 months ago
Algorithms for solving linear systems over cyclotomic fields
We consider the problem of solving a linear system Ax = b over a cyclotomic field. What makes cyclotomic fields of special interest is that we can easily find a prime p that sp...
Liang Chen, Michael B. Monagan
STOC
2007
ACM
132views Algorithms» more  STOC 2007»
16 years 3 months ago
On the convergence of Newton's method for monotone systems of polynomial equations
Monotone systems of polynomial equations (MSPEs) are systems of fixed-point equations X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where each fi is a polynomial with p...
Stefan Kiefer, Michael Luttenberger, Javier Esparz...