Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: Numer Algor

Search In Journal Title:

Abbravation: Numerical Algorithms

Search In Journal Abbravation:

Publisher

Springer US

Search In Publisher:

DOI

10.1007/1-4020-4034-2_10

Search In DOI:

ISSN

1572-9265

Search In ISSN:
Search In Title Of Papers:

A marchingon in time meshless kernel based solver

Authors: Guido Ala Elisa Francomano
Publish Date: 2012/08/29
Volume: 62, Issue: 4, Pages: 541-558
PDF Link

Abstract

A meshless particle method based on an unconditionally stable time domain numerical scheme oriented to electromagnetic transient simulations is presented The proposed scheme improves the smoothed particle electromagnetics method already developed by the authors The time stepping is approached by using the alternating directions implicit finite difference scheme in a leapfrog way The proposed formulation is used in order to efficiently overcome the stability relation constraint of explicit schemes In fact due to this constraint large time steps cannot be used with small space steps and viceversa The same stability relation holds when the meshless formulation is applied together with an explicit finite difference scheme accounted for the time stepping The computational tool is assessed and first simulation results are compared and discussed in order to validate the proposed approach

Keywords:

References

.
Search In Abstract Of Papers:
Other Papers In This Journal:
  1. Correction of eigenvalues estimated by the Legendre–Gauss Tau method
  2. Design with L-splines
  3. Accelerated Landweber methods based on co-dilated orthogonal polynomials
  4. A small note on the scaling of symmetric positive definite semiseparable matrices
  5. Solitary wave solutions of the one-dimensional Boussinesq equations
  6. Numerical solutions of index-1 differential algebraic equations can be computed in polynomial time
  7. Recursive self preconditioning method based on Schur complement for Toeplitz matrices
  8. A subspace conjugate gradient algorithm for large-scale unconstrained optimization
  9. The sparse cardinal sine decomposition and its application for fast numerical convolution
  10. A family of Steffensen type methods with seventh-order convergence
  11. On linearly related orthogonal polynomials in several variables
  12. Orthogonal polynomials—centroid of their zeroes
  13. Numerical methods for computing sensitivities for ODEs and DDEs
  14. The impact of parameter selection on the performance of an automatic adaptive code for solving reaction–diffusion equations in three dimensions
  15. A new subtraction-free formula for lower bounds of the minimal singular value of an upper bidiagonal matrix
  16. Extrapolation algorithms for solving nonlinear boundary integral equations by mechanical quadrature methods
  17. A global convergent derivative-free method for solving a system of non-linear equations
  18. A new constrained total variational deblurring model and its fast algorithm
  19. Numerical solution to generalized Lyapunov/Stein and rational Riccati equations in stochastic control
  20. Tracing the Pareto frontier in bi-objective optimization problems by ODE techniques
  21. A study of accelerated Newton methods for multiple polynomial roots
  22. A binary powering Schur algorithm for computing primary matrix roots
  23. Non-uniform exponential tension splines
  24. Nonmonotone line search methods with variable sample size
  25. Galerkin-Chebyshev spectral method and block boundary value methods for two-dimensional semilinear parabolic equations
  26. On approximated ILU and UGS preconditioning methods for linearized discretized steady incompressible Navier-Stokes equations
  27. Accelerated hybrid conjugate gradient algorithm with modified secant condition for unconstrained optimization
  28. Algorithms and software for total variation image reconstruction via first-order methods
Search Result: