Realistic Error Bounds for a Simple Eigenvalue and its Associated Eigenvector.
Rectangular Scott-type permanents.
Reducing the bandwidth in solving linear algebraic systems arising in the finite element method
The matrix of the system of linear algebraic equations, arising in the application of the finite element method to one-dimensional problems, is a bandmatrix. In approximations of high order, the band is very wide but the elements situated far from the diagonal of the matrix are negligibly small as compared with the diagonal elements. The aim of the paper is to show on a model problem that in practice it is possible to work with a matrix of the system the bandwidth of which is reduced. A simple...
Reduction of huge, sparse matrices over finite fields via created catastrophes.
Regular Splittings and the Discrete Neumann Problem.
Reguläre Zerlegungen und Berechnung des Spektralradius nichtnegativer Matrizen.
Regularization and stabilization of discrete saddle-point variational problems.
Regularization of nonlinear ill-posed equations with accretive operators.
Regularized nonnegative matrix factorization: geometrical interpretation and application to spectral unmixing
Regulatory network of drug-induced enzyme production: parameter estimation based on the periodic dosing response measurement
The common goal of systems pharmacology, i.e. systems biology applied to the field of pharmacology, is to rely less on trial and error in designing an input-output systems, e.g. therapeutic schedules. In this paper we present, on the paradigmatic example of a regulatory network of drug-induced enzyme production, the further development of the study published by Duintjer Tebbens et al. (2019) in the Applications of Mathematics. Here, the key feature is that the nonlinear model in form of an ODE system...
Rehabilitation of the Gauss-Jordan Algorithm.
Relations Between Condition Numbers and the Convergence of the Jacobi Method for Real Positive Definite Matrices.
Relative bilinear complexity and matrix multiplication.
Relaxation bei komplexen Matrizen.
Relaxation bei nichtsymmetrischen Matrizen.
Remarks on inertia theorems for matrices
Remarks on polynomial methods for solving systems of linear algebraic equations
For a large system of linear algebraic equations , the approximate solution is computed as the -th order Fourier development of the function , related to orthogonal polynomials in space. The domain in the complex plane is assumed to be known. This domain contains the spectrum of the matrix . Two algorithms for are discussed. Two possibilities of preconditioning by an application of the so called Richardson iteration process with a constant relaxation coefficient are proposed. The case...
Remarks on restriction eigenfunctions in .
Remarques sur la convergence de la méthode Q.R.
Remarques sur les algorithmes de décomposition de domaines