Untere Schranken für die Eigenwerte Stekloffscher Eigenwertaufgaben
Untersuchungen über das Wachstum von Potenzreihenabschnitten mit Anwendungen für das Hornerschema.
Updating the Singular Value Decomposition.
Upper and Lower Bounds for Solutions of Generalized Two-Point Boundary Value Problems.
Upstream weighting and mixed finite elements in the simulation of miscible displacements
Upwind computation of steady planar flames with complex chemistry
Upwind FEM for convection dominated elliptic problems
UR Birkhoff interpolation with rectangular sets of derivatives
In this paper we characterize the regular UR Birkhoff interpolation schemes ( uniform, rectangular sets of nodes) with rectangular sets of derivatives, and beyond.
Usage of modular scissors in the implementation of FEM
Finite Element Method (FEM) is often perceived as a unique and compact programming subject. Despite the fact that many FEM implementations mention the Object Oriented Approach (OOA), this approach is used completely, only in minority of cases in most real-life situations. For example, one of building stones of OOA, the interface-based polymorphism, is used only rarely. This article is focusing on the design reuse and at the same time it gives a complex view on FEM. The article defines basic principles...
Use of the multigrid methods for heat radiation problem.
Using a graph grammar system in the finite element method
The paper presents a system of Composite Graph Grammars (CGGs) modelling adaptive two dimensional hp Finite Element Method (hp-FEM) algorithms with rectangular finite elements. A computational mesh is represented by a composite graph. The operations performed over the mesh are defined by the graph grammar rules. The CGG system contains different graph grammars defining different kinds of rules of mesh transformations. These grammars allow one to generate the initial mesh, assign values to element...
Using FGMRES to obtain backward stability in mixed precision.
Using Inside-Outside Algorithm for Estimation of the Offspring Distribution in Multitype Branching Processes
Multitype branching processes (MTBP) model branching structures, where the nodes of the resulting tree are particles of different types. Usually such a process is not observable in the sense of the whole tree, but only as the “generation” at a given moment in time, which consists of the number of particles of every type. This requires an EM-type algorithm to obtain a maximum likelihood (ML) estimate of the parameters of the branching process. Using a version of the inside-outside algorithm for stochastic context-free...
Using least-squares to find an approximate eigenvector.
Using Monte Carlo Methods to Evaluate Sub-Optimal Exercise Policies for American Options
∗This research, which was funded by a grant from the Natural Sciences and Engineering Research Council of Canada, formed part of G.A.’s Ph.D. thesis [1].In this paper we use a Monte Carlo scheme to find the returns that an uninformed investor might expect from an American option if he followed one of several näıve exercise strategies rather than the optimal exercise strategy. We consider several such strategies that an ill-advised investor might follow. We also consider how the expected return...
Using successive approximations for improving the convergence of GMRES method
In this paper, our attention is concentrated on the GMRES method for the solution of the system of linear algebraic equations with a nonsymmetric matrix. We perform pre-iterations before starting GMRES and put for the initial approximation in GMRES. We derive an upper estimate for the norm of the error vector in dependence on the th powers of eigenvalues of the matrix . Further we study under what eigenvalues lay-out this upper estimate is the best one. The estimate shows and numerical...
Uso del estadístico Dn de Kolmogorov-Smirnov en inferencia paramétrica.
Se estudia un método de estimación paramétrica basado en la minimización del estadístico Dn de Kolmogorov-Smirnov. Se prueba la existencia y unicidad de este estimador en familias de distribuciones monótonas en alguno de sus parámetros y se compara computacionalmente con el método de máxima verosimilitud.
Užití maticové methody v mnohoskupinové theorii difuse neutronů