Sciweavers

414 search results - page 1 / 83
» On discrete norms of polynomials
Sort
View
JAT
2006
49views more  JAT 2006»
13 years 3 months ago
On discrete norms of polynomials
Evguenii Rakhmanov, Boris Shekhtman
MOC
2000
97views more  MOC 2000»
13 years 3 months ago
Convergence rates to the discrete travelling wave for relaxation schemes
Abstract. This paper is concerned with the asymptotic convergence of numerical solutions toward discrete travelling waves for a class of relaxation numerical schemes, approximating...
Hailiang Liu
COMPGEOM
1989
ACM
13 years 7 months ago
Computing the Irreducible Real Factors and Components of an Algebraic Curve
We present algorithms that decompose an algebraic curve with rational coefficients in its defining bivariate equation into its irreducible real factors and its non-empty irreducib...
Erich Kaltofen
MOC
2010
12 years 10 months ago
hp-Optimal discontinuous Galerkin methods for linear elliptic problems
Abstract. The aim of this paper is to present and analyze a class of hpversion discontinuous Galerkin (DG) discretizations for the numerical approximation of linear elliptic proble...
Benjamin Stamm, Thomas P. Wihler
ISSAC
1998
Springer
101views Mathematics» more  ISSAC 1998»
13 years 7 months ago
Efficient Algorithms for Computing the Nearest Polynomial with Constrained Roots
Continuous changes of the coefficients of a polynomial move the roots continuously. We consider the problem finding the minimal perturbations to the coefficients to move a root to...
Markus A. Hitz, Erich Kaltofen