Numerical Algorithms
Công bố khoa học tiêu biểu
* Dữ liệu chỉ mang tính chất tham khảo
Sắp xếp:
Convergence of polyharmonic splines on semi-regular grids $\mathbb{Z}{{\boldsymbol{\times}} \boldsymbol{a}} {\mathbb{Z}^{\it\boldsymbol{n}}}$ for ${\boldsymbol{a}\rightarrow\mathbf {0}}$
Numerical Algorithms - Tập 44 - Trang 255-272 - 2007
Let p, n ∈ ℕ with 2p ≥ n + 2, and let I
a
be a polyharmonic spline of order p on the grid ℤ × aℤ
n
which satisfies the interpolating conditions
$I_{a}\left( j,am\right) =d_{j}\left( am\right) $
for j ∈ ℤ, m ∈ ℤ...... hiện toàn bộ
New explicit stabilized stochastic Runge-Kutta methods with weak second order for stiff Itô stochastic differential equations
Numerical Algorithms - Tập 82 - Trang 593-604 - 2018
This paper introduces a new class of weak second-order explicit stabilized stochastic Runge-Kutta methods for stiff Itô stochastic differential equations. The convergence and mean-square stability properties of our new methods are analyzed. The numerical results of two examples are presented to confirm our theoretical results.
A new general system of variational inequalities for convergence theorem and application
Numerical Algorithms - Tập 81 - Trang 99-123 - 2018
In this present paper, we propose a modified form of generalized system of variational inequalities and introduce an iterative scheme for finding a common element of the set of fixed points of nonexpansive mapping and the solution set of the proposed problem in the framework of real Hilbert spaces. We prove a strong convergence theorem of the proposed iterative scheme. Applying our main result, we...... hiện toàn bộ
A PDE-informed optimization algorithm for river flow predictions
Numerical Algorithms - - Trang 1-16 - 2023
An optimization-based tool for flow predictions in natural rivers is introduced assuming that some physical characteristics of a river within a spatial-time domain
$$[x_{\min }, x_{\max }] \times [t_{\min }, t_{\textrm{today}}]$$
are known. In particular, it is assumed that the bed elevation and width of the ...... hiện toàn bộ
Enclosure of the Zero Set of Multivariate Exponential Interval Polynomials
Numerical Algorithms - Tập 37 - Trang 35-44 - 2004
The zero set of one general multivariate exponential polynomial with interval coefficients is enclosed by unions and intersections of closed half-spaces. Tighter enclosures are derived in the bivariate case. Common zeros of polynomial systems can be located by an appropriate intersection of these enclosure sets in an appropriate space. The resulting domains are directly brought into polynomial equ...... hiện toàn bộ
A new algorithm for the general quadratic programming problems with box constraints
Numerical Algorithms - - 2009
In this paper, we propose a new branch-and-bound algorithm for the general quadratic problems with box constraints. We, first, transform the problem into a separable form by D. C. decomposition and Cholesky factorization of a positive definite matrix. Then a lower bounding technique is derived and a branch-and-bound algorithm is presented based on the lower bounding and rectangular bisection. Fina...... hiện toàn bộ
Modulus-based synchronous two-stage multisplitting iteration methods for linear complementarity problems
Numerical Algorithms - - 2013
System Identifiability (Symbolic Computation) and Parameter Estimation (Numerical Computation)
Numerical Algorithms - Tập 34 - Trang 283-292 - 2003
A system identification based on physical laws often involves a parameter estimation. Before performing an estimation problem, it is necessary to investigate its identifiability. This investigation leads often to painful calculations. Generally, the numerical computation of the parameters does not use these calculus. In this contribution we propose least-squares methods to link identifiability app...... hiện toàn bộ
Analysis of the convergence of the minimal and the orthogonal residual methods
Numerical Algorithms - Tập 40 - Trang 201-216 - 2005
We consider two Krylov subspace methods for solving linear systems, which are the minimal residual method and the orthogonal residual method. These two methods are studied without referring to any particular implementations. By using the Petrov–Galerkin condition, we describe the residual norms of these two methods in terms of Krylov vectors, and the relationship between there two norms. We defin...... hiện toàn bộ
High-precision computation of the weak Galerkin methods for the fourth-order problem
Numerical Algorithms - Tập 84 Số 1 - Trang 181-205 - 2020
Tổng số: 2,550
- 1
- 2
- 3
- 4
- 5
- 6
- 10