MOC
2000
14 years 6 days ago
2000
The ultraconvergence property of a gradient recovery technique proposed by Zienkiewicz and Zhu is analyzed for the Laplace equation in the two dimensional setting. Under the assump...
MOC
2000
14 years 6 days ago
2000
MOC
2000
14 years 6 days ago
2000
Some recent methods of Computer Aided Geometric Design are related to the apolar bilinear form, an inner product on the space of homogeneous multivariate polynomials of a fixed deg...
MOC
2000
14 years 6 days ago
2000
The purpose of this paper is to describe a method to determine whether a bivariate polynomial with rational coefficients is irreducible when regarded as an element in Q((x))[y], th...
MOC
2000
14 years 6 days ago
2000
A number of new local and parallel discretization and adaptive finite element algorithms are proposed and analyzed in this paper for elliptic boundary value problems. These algorit...
MOC
2000
14 years 6 days ago
2000
Abstract. We propose a discretization scheme for a numerical solution of elliptic PDE's, based on local representation of functions, by their Taylor polynomials (jets). This s...
MOC
2000
14 years 6 days ago
2000
In this paper we analyze the bi-conjugate gradient algorithm in finite precision arithmetic, and suggest reasons for its often observed robustness. By using a tridiagonal structure...
MOC
2000
14 years 6 days ago
2000
Abstract. We consider the equations of stationary incompressible magnetohydrodynamics posed in three dimensions, and treat the full coupled system of equations with inhomogeneous b...
MOC
2000
14 years 6 days ago
2000
In this paper, we solve a certain family of diophantine equations associated with a family of cyclic quartic number fields. In fact, we prove that
MOC
2000
14 years 6 days ago
2000
Given an odd prime p we show a way to construct large families of polynomials Pq(x) Q[x], q C, where C is a set of primes of the form q 1 mod p and Pq(x) is the irreducible poly...