Search
Now showing items 41-50 of 62
Preprint
Approximate Approximations and a Boundary Point Method for the Linearized Stokes System
(2007)
The method of approximate approximations, introduced by Maz'ya [1], can also be used for the numerical solution of boundary integral equations. In this case, the matrix
of the resulting algebraic system to compute an approximate source density depends only on the position of a finite number of boundary points and on the direction of the normal vector in these points (Boundary Point Method). We investigate this approach for the Stokes problem in the whole space and for the Stokes boundary value problem in a bounded ...
Preprint
On the relationship between the Method of Least Squares and Gram-Schmidt orthogonalization
(2010)
The method of Least Squares is due to Carl Friedrich Gauss. The Gram-Schmidt
orthogonalization method is of much younger date. A method for solving Least Squares Problems is developed which automatically results in the appearance of the Gram-Schmidt orthogonalizers. Given these orthogonalizers an induction-proof is available for solving Least Squares Problems.
Preprint
The Parity of the Number of Irreducible Factors for Some Pentanomials
(2008)
It is well known that Stickelberger-Swan theorem is very important for determining reducibility of polynomials over a binary field. Using this theorem it was determined the parity of the number of irreducible factors for some kinds of polynomials over a binary field, for instance, trinomials,
tetranomials, self-reciprocal polynomials and so on. We discuss this problem for type II pentanomials namely x^m +x^{n+2} +x^{n+1} +x^n +1 \in\ IF_2 [x].
Such pentanomials can be used for efficient implementing multiplication ...
Preprint
On Nonlinear Preconditioners in Newton-Krylov-Methods for Unsteady Flows
(2008)
The application of nonlinear schemes like dual time stepping as preconditioners in matrix-free Newton-Krylov-solvers is considered and analyzed. We provide a novel formulation of the left preconditioned operator that says it is in fact linear in the matrix-free sense, but changes the Newton scheme. This allows to get some insight in the convergence properties of these schemes which are demonstrated through numerical results.
Preprint
Parity of the Number of Irreducible Factors for Composite Polynomials
(2008)
Various results on parity of the number of irreducible factors of given polynomials over finite fields have been obtained in the recent literature. Those are mainly based on Swan’s theorem in which discriminants of polynomials over a finite field or the integral ring Z play an important role. In this paper we consider discriminants of the composition of some polynomials over finite fields. The relation between the discriminants of composed polynomial and the original ones will be established. We apply this to obtain ...
Preprint
Divisibility of Trinomials by Irreducible Polynomials over F_2
(2008)
Irreducible trinomials of given degree n over F_2 do not always exist and in the cases that there is no irreducible trinomial of degree n it may be effective to use trinomials with an irreducible factor of degree n. In this paper we consider some conditions under which irreducible polynomials divide trinomials over F_2. A condition for divisibility of self-reciprocal trinomials by irreducible polynomials over F_2 is established. And we extend Welch's criterion for testing if an irreducible polynomial divides trinomials ...
Preprint
A free boundary approach to the Rosensweig instability of ferrofluids
(2017-04-18)
We establish the existence of saddle points for a free boundary problem describing the two-dimensional free surface of a ferrofluid which undergoes normal field instability (also known as Rosensweig instability). The starting point consists in the ferro-hydrostatic equations for the magnetic potentials in the ferrofluid and air, and the function describing their interface. The former constitute the strong form for the Euler-Lagrange equations of a convex-concave functional. We extend this functional in order to ...
Preprint
On the existence of symmetric minimizers
(2018-01-23)
In this note we revisit a less known symmetrization method for functions with respect to a topological group, which we call G-averaging. We note that, although quite non-technical in nature, this method yields G-invariant minimizers of functionals satisfying some relaxed convexity properties. We give an abstract theorem and show how it can be applied to the p-Laplace and polyharmonic Poisson problem in order to construct symmetric solutions. We also pose some open problems and explore further possibilities where the ...
Preprint
On Oseen Resolvent Estimates: A Negative Result
(2009)
We consider the resolvent problem for the scalar Oseen equation in the whole space R^3. We show that for small values of the resolvent parameter it is impossible to obtain an L^2-estimate analogous to
the one which is valid for the Stokes resolvent, even if the resolvent parameter has positive real part.
Preprint
Image compression predicated on recurrent iterated function systems
(2008)
Recurrent iterated function systems (RIFSs) are improvements of iterated function systems (IFSs) using elements of the theory of Marcovian stochastic processes which can produce more natural looking images. We construct new RIFSs consisting substantially of a vertical contraction factor function and nonlinear transformations. These RIFSs are applied to image compression.