Robust kinetics estimation from kinematics via direct collocation. [PDF]
Wang K +5 more
europepmc +1 more source
An efficient discrete Chebyshev polynomials strategy for tempered time fractional nonlinear Schrödinger problems. [PDF]
Heydari MH, Baleanu D.
europepmc +1 more source
Nystrom technique analysis of the terahertz and infrared range radar cross section of a circular dielectric cylinder with graphene strips inside. [PDF]
Kaliberda ME, Pogarsky S.
europepmc +1 more source
AI-driven adaptive vibration control in smart plate systems: a sustainable approach for next-generation sports engineering. [PDF]
Lin B, Wang J, Safarpour M, Yaylacı M.
europepmc +1 more source
Hippocampus supports long-term maintenance of language representations: Evidence of impaired collocation knowledge in amnesia. [PDF]
Covington NV, Duff MC.
europepmc +1 more source
Optimizing toe joint stiffness to improve human-like walking. [PDF]
Cho K, Lee KW, Hur P.
europepmc +1 more source
Related searches:
On convergence of collocation technique
Journal of Electronics, 1991In this paper, the convergence rate at matching points of collocation technique is shown to beO(h 2), that is just the same as the global convergence rate of Galerkin’s method with triangular pulses as basis and weighting functions. A numerical example to verify the conclusion is given.
Wenxun Zhang
exaly +2 more sources
Adaptive Techniques for Spline Collocation
Computing, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Christina C. Christara, Kit Sun Ng
openaire +1 more source
Constructive techniques for approximating collocation linear systems
Numerical Algorithms, 2000A high order discretization by spectral collocation methods of the elliptic problem \[ A_{A,b}u= -\nabla\bigl[ A(x)\nabla u(x)\bigr]+ b(x)u (x) =C(x)\text{ on }\Omega= (-1,1)^2; \quad u|_{\partial \Omega}=0; \] in two variables \(x=(x^{[1]}, x^{[2]})\) is considered.
TABLINO POSSIO C. +1 more
openaire +3 more sources
Adaptive Refinement Techniques for RBF-PU Collocation
2020We propose new adaptive refinement techniques for solving Poisson problems via a collocation radial basis function partition of unity (RBF-PU) method. As the construction of an adaptive RBF-PU method is still an open problem, we present two algorithms based on different error indicators and refinement strategies that turn out to be particularly suited ...
Roberto Cavoretto, Alessandra De Rossi
openaire +1 more source

