Method of curvature in circular complex arithmetic.
Numerical Algorithms for the Nevanlinna-Pick Problem.
Numerical analytic continuation of holomorphic functions in
Numerical conformal mappings of unbounded multiply-connected domains using the charge simulation method.
Numerical treatment of 3-dimensional potential problem
Assuming an incident wave to be a field source, we calculate the field potential in a neighborhood of an inhomogeneous body. This problem which has been formulated in can be reduced to a bounded domain. Namely, a boundary condition for the potential is formulated on a sphere. Then the potential satisfies a well posed boundary value problem in a ball containing the body. A numerical approximation is suggested and its convergence is analyzed.
Numerische Ermittlung quasikonformer Abbildungen mit finiten Elementen.
On Clenshaws's Method and a Generalisation to Faber Series.
On Computing Reciprocals of Power Series.
On finding the largest root of a polynomial
On Ostrowski's fundamental existence theorem in the complex case.
On the computation of Aden functions
The paper deals with the computation of Aden functions. It gives estimates of errors for the computation of Aden functions by downward reccurence.
On the Computation of Inclusion Regions for Partitioned Matrices.
On the Condition Number of some Gram Matrices Arising from Least Squares Approximation in the Complex Plane.
On the Existence of Optimal Integration Formulas for Analytic Functions.
On the nomographic chart of three complex variables in the line coordinates
The author investigates methods of nomographing functional relations among three complex variables which satisfy the equation (involving Massau’s complex chart determinant) det , in the line coordinates.
On the numerical solution of the first biharmonic equation
On the preconditioned biconjugate gradients for solving linear complex equations arising from finite elements
The paper analyses the biconjugate gradient algorithm and its preconditioned version for solving large systems of linear algebraic equations with nonsingular sparse complex matrices. Special emphasis is laid on symmetric matrices arising from discretization of complex partial differential equations by the finite element method.
On the Various Bisection Methods Derived from Vincent’s Theorem
In 2000 A. Alesina and M. Galuzzi presented Vincent’s theorem “from a modern point of view” along with two new bisection methods derived from it, B and C. Their profound understanding of Vincent’s theorem is responsible for simplicity — the characteristic property of these two methods. In this paper we compare the performance of these two new bisection methods — i.e. the time they take, as well as the number of intervals they examine in order to isolate the real roots of polynomials — against that...
Optimal quadratures for a certain class of analytic functions
Quotienten-Differenzen-Algorithmus: Beweis der Regeln von Rutishauser (Quotient-Difference Algorithm: Proof of Rutishauser's Ru e)