Results 201 to 210 of about 2,254,947 (237)
Multi-projection method for Volterra integral equations at the collocation points
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Khosrow Maleknejad
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Collocation at Gauss Points as a Discretization in Optimal Control
SIAM Journal on Control and Optimization, 1979Collocation at Gauss points is shown to be a high order accurate discretization of certain unconstrained optimal control problems. Best possible convergence rates are established along with superconvergence results.
openaire +2 more sources
A meshless point collocation treatment of transient bioheat problems
International Journal for Numerical Methods in Biomedical Engineering, 2014SUMMARYA meshless numerical method is proposed for the solution of the transient bioheat equation in two and three dimensions. The Pennes bioheat equation is extended in order to incorporate water evaporation, tissue damage, and temperature‐dependent tissue properties during tumor ablation.
G C, Bourantas +3 more
openaire +2 more sources
The Richardson Extrapolation Process with a Harmonic Sequence of Collocation Points
SIAM Journal on Numerical Analysis, 2000The author studies the problem: Let a function \(A(y)\) be known and hence computable for \(00\), the variable \(y\) being continuous or discrete. The author assumes that \(A(y)\) has an asymptotic expansion of the form \[ A(y)\sim A+ \sum_{k=1}^\infty \alpha_k y^{\sigma_k} \quad\text{as}\quad y\to 0+, \] where \(\sigma_k\) are known scalars satisfying
openaire +3 more sources
On a misconception involving point collocation and the Rayleigh hypothesis
IEEE Transactions on Antennas and Propagation, 1996Summary: It is shown that the Rayleigh hypothesis does not govern convergence of the simple point collocation approach to the numerical solution of scattering by a sinusoidal grating. A recently developed numerical technique, interval arithmetic, is employed to perform some decisive numerical experiments which not only support but guarantee the ...
Christiansen, Søren, Kleinman, Ralph E.
openaire +2 more sources
Collocation by L-Splines at Transformed Gaussian Points
SIAM Journal on Numerical Analysis, 1984zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Collocation for Two-Point Boundary Value Problems Revisited
SIAM Journal on Numerical Analysis, 1986Collocation methods for two-point boundary value problems for higher differential equations are considered. By using appropriate monomial bases, these methods are related to corresponding one-step schemes for first order systems of differential equations.
openaire +2 more sources
Errors in Iteration Points in Oscillatory State for Chebyshev Collocation Points
1999When the Chebyshev collocation point is calculated by Newton’s iteration process, the round-off errors of iteration points are difficult to analyze. The equation which determines the unknown round-off error is obtained for the iteration point under the condition that the iteration point is stationary.
openaire +1 more source
Maximum principle and convergence analysis for the meshfree point collocation method
SIAM Journal on Numerical Analysis, 2006The discrete Laplacian operator is considered in the sense of the meshfree point collocation method which will be called the strong meshfree Laplacian operator. To define the strong meshfree Laplacian operator, we use the fast version of the generalized moving least square approximation, which can calculate the approximated derivatives of shape ...
Do Wan Kim, Wing Kam Liu
openaire +2 more sources
Nonoverlapping domain decomposition with cross points for orthogonal spline collocation
Journal of Numerical Mathematics, 2008A nonoverlapping domain decomposition approach with uniform and matching grids is used to define and compute the orthogonal spline collocation solution of the Dirichlet boundary-value problem for Poisson's equation on a square partitioned into four squares.
Bernard Bialecki, Maksymilian Dryja
openaire +3 more sources

