The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
This contribution gives an overview of current research in applying object oriented programming to scientific computing at the computational mechanics laboratory (LABMEC) at the school of civil engineering – UNICAMP. The main goal of applying object oriented programming to scientific computing is to implement increasingly complex algorithms in a structured manner and to hide the complexity behind a simple user interface. The following areas are current topics of research and documented within the...
This contribution gives an overview of current research in applying object oriented programming to scientific computing at the computational mechanics laboratory (LABMEC) at the school of civil engineering – UNICAMP. The main goal of applying object oriented programming to scientific computing is to implement increasingly complex algorithms in a structured manner and to hide the complexity behind a simple user interface. The following areas are current topics of research and documented within the...
We discuss a parallel implementation of the domain
decomposition method based on the macro-hybrid formulation
of a second order elliptic
equation and on an approximation by the mortar element method.
The discretization leads to an algebraic saddle- point problem.
An iterative method with a block- diagonal
preconditioner is used for solving the saddle- point problem.
A parallel implementation of the method is emphasized.
Finally the results of numerical experiments are presented.
FETI (finite element tearing and interconnecting) based domain decomposition methods are well-established massively parallel methods for solving huge linear systems arising from discretizing partial differential equations. The first steps of FETI decompose the domain into nonoverlapping subdomains, discretize the subdomains using matching grids, and interconnect the adjacent variables by multipoint constraints. However, the multipoint constraints enforcing identification of the corners' variables...
A simple explicit numerical scheme is proposed for the solution of the Gardner–Ostrovsky
equation (ut + cux + α uux + α1u2ux + βuxxx)x = γu
which is also known as the extended rotation-modified Korteweg–de Vries
(KdV) equation. This equation is used for the description of internal oceanic waves
affected by Earth’ rotation. Particular versions of this equation with zero some of
coefficients, α, α1, β, or
γ are also known in numerous applications....
We investigate the number of iterations needed by an addition algorithm due to Burks et al. if the input is random. Several authors have obtained results on the average case behaviour, mainly using analytic techniques based on generating functions. Here we take a more probabilistic view which leads to a limit theorem for the distribution of the random number of steps required by the algorithm and also helps to explain the limiting logarithmic periodicity as a simple discretization phenomenon.
We investigate the number of iterations needed by an addition algorithm due to
Burks et al. if the input is random. Several authors have obtained results on
the average case behaviour, mainly using analytic techniques based on generating functions. Here we
take a more probabilistic view which leads to a limit theorem for the distribution of the random
number of steps required by the algorithm and also helps to explain the limiting logarithmic
periodicity as a simple discretization phenomenon.
We study the complexity of Banach space valued integration in the randomized setting. We are concerned with r times continuously differentiable functions on the d-dimensional unit cube Q, with values in a Banach space X, and investigate the relation of the optimal convergence rate to the geometry of X. It turns out that the nth minimal errors are bounded by if and only if X is of equal norm type p.
Currently displaying 1 –
20 of
21