نتایج جستجو برای: discrete solution

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

Journal: :Numerical Lin. Alg. with Applic. 2016
Silvia Gazzola Enyinda Onunwor Lothar Reichel Giuseppe Rodriguez

The symmetric Lanczos method is commonly applied to reduce large-scale symmetric linear discrete ill-posed problems to small ones with a symmetric tridiagonal matrix. We investigate how quickly the nonnegative subdiagonal entries of this matrix decay to zero. Their fast decay to zero suggests that there is little benefit in expressing the solution of the discrete ill-posed problems in terms of ...

Nowadays, numerical modelings play a key role in analyzing hydraulic problems in fractured rock media. The discrete fracture network model is one of the most used numerical models to simulate the geometrical structure of a rock-mass. In such media, discontinuities are considered as discrete paths for fluid flow through the rock-mass while its matrix is assumed impermeable. There are two main pa...

2000
Daisuke SATOH

I describe a software reliability growth model that yields accurate parameter estimates even with a small amount of input data. The model is based on a proposed discrete analog of a Gompertz equation that has an exact solution. The difference equation tends to a differential equation on which the Gompertz curve model is defined, when the time interval tends to zero. The exact solution also tend...

2014
SILVIA NOSCHESE LOTHAR REICHEL

Lavrentiev regularization is a popular approach to the solution of linear discrete illposed problems with a Hermitian positive semidefinite matrix. This paper describes Lavrentiev-type regularization methods that can be applied to the solution of linear discrete ill-posed problems with a general Hermitian matrix. Fractional Lavrentiev-type methods as well as modifications suggested by the solut...

2009
MARTE GODVIK

We consider a semi-discrete car-following model and the macroscopic Aw–Rascle model for traffic flow given in Lagrangian form. The solution of the car-following model converges to a weak entropy solution of the system of hyperbolic balance laws with Cauchy initial data. For the homogeneous system, we allow vacuum in the initial data. By using properties of the semi-discrete model, we show that ...

This paper studies a new multi-objective fuzzy optimization prob- lem. The objective function of this study has dierent levels. Therefore, a suitable optimized solution for this problem would be an optimized solution with preemptive priority. Since, the feasible domain is non-convex; the tra- ditional methods cannot be applied. We study this problem and determine some special structures related...

2007
Richard Liska Mikhail Shashkov

The maximum principle is a basic qualitative property of the solution of second-order elliptic boundary value problems. The preservation of the qualitative characteristics, such as the maximum principle, in discrete model is one of the key requirements. It is well known that standard linear finite element solution does not satisfy maximum principle on general triangular meshes in 2D. In this pa...

Journal: :I. J. Robotics Res. 1999
Geir Hovland Brenan J. McCarragher

The problem of controlling sensory input and perception for use in mobile navigation is addressed in this paper. The proposed solution offers several advantages compared with existing methods in the literature. First, the proposed solution is based on a stochastic dynamic-programming algorithm that guarantees cost efficiency of the real-time sensory-perception controller by solving a constraine...

Journal: :Numerische Mathematik 2014
Mario Bukal Etienne Emmrich Ansgar Jüngel

Structure-preserving numerical schemes for a nonlinear parabolic fourthorder equation, modeling the electron transport in quantum semiconductors, with periodic boundary conditions are analyzed. First, a two-step backward differentiation formula (BDF) semi-discretization in time is investigated. The scheme preserves the nonnegativity of the solution, is entropy stable and dissipates a modified e...

2013
Douglas N. Arnold

A problem in differential equations can rarely be solved analytically, and so often is discretized, resulting in a discrete problem which can be solved in a finite sequence of algebraic operations, efficiently implementable on a computer. The error in a discretization is the difference between the solution of the original problem and the solution of the discrete problem, which must be defined s...

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

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