Das modifizierte Newton-Verfahren in verallgemeinerten Banach-Räumen.
Decomposition conditions for two-point boundary value problems.
Degeneration and complexity of bilinear maps: Some asymptotic spectra.
Degree of convergence of iterative algorithms for boundedly Lipschitzian strong pseudocontractions.
Determination of eigenvalues and eigenfunctions of bounded self-adjoint operators (Preliminary communication)
Determination of the Invariant Interval for Positive Linear Operators by a Nonstationary Iterative Procedure
Difference Approximations for Singular Perturbations of Systems of Ordinary Differential Equations.
Digital simulation of analog computing differential equations with variable coefficients and nonlinear differential equations
Discrete Newton Methods and Iterated Defect Corrections.
Diskrete Approximation von Eigenwertproblemen. I. Qualitative Konvergenz.
Diskrete Approximation von Eigenwertproblemen. II. Konvergenzordnung.
Diskrete Approximation von Eigenwertproblemen. III. Asymptotische Entwicklungen. - Discrete Approximation of Eigenvalue-Problems. III. Asymptotic Expansions.
Div-curl lemma revisited: Applications in electromagnetism
Two new time-dependent versions of div-curl results in a bounded domain are presented. We study a limit of the product , where the sequences and belong to . In Theorem 2.1 we assume that is bounded in the -norm and is controlled in the -norm. In Theorem 2.2 we suppose that is bounded in the -norm and is controlled in the -norm. The time derivative of is bounded in both cases in the norm of . The convergence (in the sense of distributions) of to the product of weak limits...
Does Newton's method for set-valued maps converges uniformly in mild differentiability context?
Double greedy algorithms: Reduced basis methods for transport dominated problems
The central objective of this paper is to develop reduced basis methods for parameter dependent transport dominated problems that are rigorously proven to exhibit rate-optimal performance when compared with the Kolmogorov n-widths of the solution sets. The central ingredient is the construction of computationally feasible “tight” surrogates which in turn are based on deriving a suitable well-conditioned variational formulation for the parameter dependent problem. The theoretical results are illustrated...
Dynamic systems described by differential equations with singularities of the type and their machine solving
Dynamic systems with the nonzero initial conditions excited by the Dirac function
Dynamical systems method for solving linear finite-rank operator equations
A version of the dynamical systems method (DSM) for solving ill-conditioned linear algebraic systems is studied. An a priori and an a posteriori stopping rules are justified. An iterative scheme is constructed for solving ill-conditioned linear algebraic systems.