نتایج جستجو برای: triangular approximations

تعداد نتایج: 53274  

2002
Raytcho D. Lazarov Svetozar Margenov

In this paper we analyze a two-level preconditioner for finite element systems arising in approximations of second order elliptic boundary value problems by Crouzeix-Raviart non-conforming triangular linear elements. This study is focused on the efficient implementation of the modified incomplete LU factorization MIC(0) as a preconditioner in the PCG iterative method for the linear algebraic sy...

2008
Valentin Konakov Enno Mammen

We consider triangular arrays of Markov chains that converge weakly to a diffusion process. Second order Edgeworth type expansions for transition densities are proved. The paper differs from recent results in two respects. We allow nonhomogeneous diffusion limits and we treat transition densities with time lag converging to zero. Small time asymptotics are motivated by statistical applications ...

2007
Victorita Dolean Richard Pasquetti Francesca Rapetti F. Rapetti

Spectral element approximations based on triangular elements and on the so-called Fekete points of the triangle have been recently developed. p-multigrid methods offer an interesting way to resolve efficiently the resulting ill-conditioned algebraic systems. For elliptic problems, it is shown that a well chosen restriction operator and a good set up of the coarse grid matrices may lead to valua...

2010
G. W. Howell

This paper describes Householder reduction of a rectangular sparse matrix to small band upper triangular form Bk+1. Bk+1 is upper triangular with nonzero entries only on the diagonal and on the nearest k superdiagonals. The algorithm is similar to the Householder reduction used as part of the standard dense SVD computation. For the sparse “lazy” algorithm, matrix updates are deferred until a ro...

In this paper, we consider the width invariant trapezoidal and triangularapproximations of fuzzy numbers. The presented methods avoid the effortful computation of Karush-Kuhn-Tucker Theorem. Some properties of the new approximation methods are presented and the applicability of the methods is illustrated by examples. In addition, we show that the proposed approximations of fuzzy numbers preserv...

In this paper a linear Fuzzy Fredholm Integral Equation(FFIE) with arbitrary Fuzzy Function input and symmetric triangular (Fuzzy Interval) output is considered. For each variable, output is the nearest triangular fuzzy number (fuzzy interval) to the exact fuzzy solution of (FFIE).

2017
Amélie Neuville Eirik Grude Flekkøy Renaud Toussaint A. Neuville E. G. Flekkøy R. Toussaint

The characteristics of the hydro-thermal flow which occurs when a cold fluid is injected into a hot fractured bedrock depend on the morphology of the fracture. We consider a sharp triangular asperity, invariant in one direction, perturbing an otherwise flat fracture. We investigate its influence on the macroscopic hydraulic transmissivity and heat transfer efficiency, at fixed low Reynolds numb...

Journal: :SIAM J. Matrix Analysis Applications 2014
Yvan Notay

We consider symmetric saddle point matrices. We analyze block preconditioners based on the knowledge of a good approximation for both the top left block and the Schur complement resulting from its elimination. We obtain bounds on the eigenvalues of the preconditioned matrix that depend only of the quality of these approximations, as measured by the related condition numbers. Our analysis applie...

2009
G. W. Howell

This paper describes Householder reduction of a rectangular sparse matrix to small band upper triangular form. Using block Householder transformations gives good orthogonality, is computationally efficient, and has good potential for parallelization. The algorithm is similar to the standard dense Householder reduction used as part of the usual dense SVD computation. For the sparse algorithm, th...

1997
Miguel Angel García Angel Domingo Sappa Luis Basañez

This paper presents an eficient algorithm for generating adaptive triangular meshes from dense range images. The proposed technique consists of two stages. First, a quadrilateral mesh is generated from the given range image. The points of this mesh adapt to the surface shapes represented in the range image by grouping in areas of high curvature and dispersing in low-variation regions. The secon...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید