Sciweavers

7 search results - page 1 / 2
» Error Bounds for Lanczos Approximations of Rational Function...
Sort
View
DAGSTUHL
2008
14 years 8 days ago
Error Bounds for Lanczos Approximations of Rational Functions of Matrices
Abstract. Having good estimates or even bounds for the error in computing approximations to expressions of the form f(A)v is very important in practical applications. In this paper...
Andreas Frommer, Valeria Simoncini
DATE
2002
IEEE
131views Hardware» more  DATE 2002»
14 years 3 months ago
Passive Constrained Rational Approximation Algorithm Using Nevanlinna-Pick Interpolation
As system integration evolves and tighter design constraints must be met, it becomes necessary to account for the non-ideal behavior of all the elements in a system. For high-spee...
Carlos P. Coelho, Luis Miguel Silveira, Joel R. Ph...
AAECC
2007
Springer
117views Algorithms» more  AAECC 2007»
13 years 11 months ago
A predictor-corrector-type technique for the approximate parameterization of intersection curves
Abstract We describe a method to approximate a segment of the intersection curve of two implicitly defined surfaces by a rational parametric curve. Starting from an initial soluti...
Bert Jüttler, Pavel Chalmovianský
DMTCS
2003
89views Mathematics» more  DMTCS 2003»
14 years 6 days ago
On the Monotonic Computability of Semi-computable Real Numbers
Let h : N → Q be a computable function. A real number x is h-monotonically computable (h-mc, for short) if there is a computable sequence (xs) of rational numbers which converges...
Xizhong Zheng, George Barmpalias
ISSAC
2007
Springer
130views Mathematics» more  ISSAC 2007»
14 years 5 months ago
On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms
Algebraic randomization techniques can be applied to hybrid symbolic-numeric algorithms. Here we consider the problem of interpolating a sparse rational function from noisy values...
Erich Kaltofen, Zhengfeng Yang, Lihong Zhi