Sciweavers

1469 search results - page 50 / 294
» Approximate polynomial decomposition
Sort
View
ARITH
2007
IEEE
15 years 4 months ago
Floating-point L2-approximations to functions
In the present paper, we investigate the approximation of a function by a polynomial with floating-point coefficients; we are looking for the best approximation in the L2 sense....
Nicolas Brisebarre, Guillaume Hanrot
NA
2006
70views more  NA 2006»
14 years 9 months ago
A truncated projected SVD method for linear discrete ill-posed problems
Truncated singular value decomposition is a popular solution method for linear discrete ill-posed problems. However, since the singular value decomposition of the matrix is indepen...
Serena Morigi, Lothar Reichel, Fiorella Sgallari
DATE
2002
IEEE
87views Hardware» more  DATE 2002»
15 years 2 months ago
Model Reduction in the Time-Domain Using Laguerre Polynomials and Krylov Methods
We present a new passive model reduction algorithm based on the Laguerre expansion of the time response of interconnect networks. We derive expressions for the Laguerre coefficie...
Yiran Chen, Venkataramanan Balakrishnan, Cheng-Kok...
FSS
2002
125views more  FSS 2002»
14 years 9 months ago
An "orderwise" polynomial regression procedure for fuzzy data
In this work we study approximation of fuzzy functions on a finite set of distinct points. Two types of approximation are considered, one method based on fuzzy linear programming p...
Pierpaolo D'Urso, Tommaso Gastaldi
ICASSP
2011
IEEE
14 years 1 months ago
Nonnegative 3-way tensor factorization via conjugate gradient with globally optimal stepsize
This paper deals with the minimal polyadic decomposition (also known as canonical decomposition or Parafac) of a 3way array, assuming each entry is positive. In this case, the low...
Jean-Philip Royer, Pierre Comon, Nadège Thi...