Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Mathematical models of various natural processes are described by differential equations, systems of partial differential equations and integral equations. In most cases, the exact solution to such problems cannot be determined; therefore, one has to use grid methods to calculate an approximate solution using high-performance computing systems. These methods include the finite element method, the finite difference method, the finite volume method and combined methods. In this Special Issue, we bring to your attention works on theoretical studies of grid methods for approximation, stability and convergence, as well as the results of numerical experiments confirming the effectiveness of the developed methods. Of particular interest are new methods for solving boundary value problems with singularities, the complex geometry of the domain boundary and nonlinear equations. A part of the articles is devoted to the analysis of numerical methods developed for calculating mathematical models in various fields of applied science and engineering applications. As a rule, the ideas of symmetry are present in the design schemes and make the process harmonious and efficient.

high-order methods --- Brinkman penalization --- discontinuous Galerkin methods --- embedded geometry --- high-order boundary --- IMEX Runge–Kutta methods --- boundary value problems with degeneration of the solution on entire boundary of the domain --- the method of finite elements --- special graded mesh --- multigrid methods --- Hermitian/skew-Hermitian splitting method --- skew-Hermitian triangular splitting method --- strongly non-Hermitian matrix --- lie symmetries --- invariantized difference scheme --- numerical solutions --- finite integration method --- shifted Chebyshev polynomial --- direct and inverse problems --- Volterra integro-differential equation --- Tikhonov regularization method --- quartic spline --- triangulation --- scattered data --- continuity --- surface reconstruction --- positivity-preserving --- interpolation --- jaw crusher --- symmetrical laser cladding path --- FEPG --- wear

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This reprint presents a collection of contributions on the application of high-performing computational strategies and enhanced theoretical formulations to solve a wide variety of linear or nonlinear problems in a multiphysical sense, together with different experimental studies.

Technology: general issues --- History of engineering & technology --- nanotwin --- detwinning --- extreme hardness --- excellent stability --- electrospinning --- nanofibrous membrane --- geometric modeling --- uniaxial tensile --- buckling --- electromagnetic field --- nanobeam --- shifted chebyshev polynomial --- rayleigh-ritz method --- nanocomposites --- FG-CNTRC --- truncated cone --- critical combined loads --- multi-scale mechanics --- finite element analysis --- material testing --- cellulose nanofiber --- polymer composites --- tensile modulus --- cove-edges --- defects --- fracture --- graphene --- molecular dynamics --- strength --- recycling --- circular economy --- nanometric carbon-based ashes --- AJ®P --- non-piezoelectric polymers --- tactile sensors --- robotic gripper --- fluorinated epoxy resin --- fluorinated graphene oxide --- ordered filling --- elastic modulus --- glass transition temperature --- microscopic parameters --- surface bonding --- nanocone arrays --- molecular dynamics simulation --- axially functionally graded materials --- differential quadrature method --- flexural-torsional buckling --- nonlocal elasticity theory --- tapered I-beam --- nanotwin --- detwinning --- extreme hardness --- excellent stability --- electrospinning --- nanofibrous membrane --- geometric modeling --- uniaxial tensile --- buckling --- electromagnetic field --- nanobeam --- shifted chebyshev polynomial --- rayleigh-ritz method --- nanocomposites --- FG-CNTRC --- truncated cone --- critical combined loads --- multi-scale mechanics --- finite element analysis --- material testing --- cellulose nanofiber --- polymer composites --- tensile modulus --- cove-edges --- defects --- fracture --- graphene --- molecular dynamics --- strength --- recycling --- circular economy --- nanometric carbon-based ashes --- AJ®P --- non-piezoelectric polymers --- tactile sensors --- robotic gripper --- fluorinated epoxy resin --- fluorinated graphene oxide --- ordered filling --- elastic modulus --- glass transition temperature --- microscopic parameters --- surface bonding --- nanocone arrays --- molecular dynamics simulation --- axially functionally graded materials --- differential quadrature method --- flexural-torsional buckling --- nonlocal elasticity theory --- tapered I-beam

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Numerical methods are a specific form of mathematics that involve creating and use of algorithms to map out the mathematical core of a practical problem. Numerical methods naturally find application in all fields of engineering, physical sciences, life sciences, social sciences, medicine, business, and even arts. The common uses of numerical methods include approximation, simulation, and estimation, and there is almost no scientific field in which numerical methods do not find a use. Results communicated here include topics ranging from statistics (Detecting Extreme Values with Order Statistics in Samples from Continuous Distributions) and Statistical software packages (dCATCH—A Numerical Package for d-Variate near G-Optimal Tchakaloff Regression via Fast NNLS) to new approaches for numerical solutions (Exact Solutions to the Maxmin Problem max‖Ax‖ Subject to ‖Bx‖≤1; On q-Quasi-Newton’s Method for Unconstrained Multiobjective Optimization Problems; Convergence Analysis and Complex Geometry of an Efficient Derivative-Free Iterative Method; On Derivative Free Multiple-Root Finders with Optimal Fourth Order Convergence; Finite Integration Method with Shifted Chebyshev Polynomials for Solving Time-Fractional Burgers’ Equations) to the use of wavelets (Orhonormal Wavelet Bases on The 3D Ball Via Volume Preserving Map from the Regular Octahedron) and methods for visualization (A Simple Method for Network Visualization).

Research & information: general --- Mathematics & science --- Clenshaw–Curtis–Filon --- high oscillation --- singular integral equations --- boundary singularities --- local convergence --- nonlinear equations --- Banach space --- Fréchet-derivative --- finite integration method --- shifted Chebyshev polynomial --- Caputo fractional derivative --- Burgers’ equation --- coupled Burgers’ equation --- maxmin --- supporting vector --- matrix norm --- TMS coil --- optimal geolocation --- probability computing --- Monte Carlo simulation --- order statistics --- extreme values --- outliers --- multiobjective programming --- methods of quasi-Newton type --- Pareto optimality --- q-calculus --- rate of convergence --- wavelets on 3D ball --- uniform 3D grid --- volume preserving map --- Network --- graph drawing --- planar visualizations --- multiple root solvers --- composite method --- weight-function --- derivative-free method --- optimal convergence --- multivariate polynomial regression designs --- G-optimality --- D-optimality --- multiplicative algorithms --- G-efficiency --- Caratheodory-Tchakaloff discrete measure compression --- Non-Negative Least Squares --- accelerated Lawson-Hanson solver --- Clenshaw–Curtis–Filon --- high oscillation --- singular integral equations --- boundary singularities --- local convergence --- nonlinear equations --- Banach space --- Fréchet-derivative --- finite integration method --- shifted Chebyshev polynomial --- Caputo fractional derivative --- Burgers’ equation --- coupled Burgers’ equation --- maxmin --- supporting vector --- matrix norm --- TMS coil --- optimal geolocation --- probability computing --- Monte Carlo simulation --- order statistics --- extreme values --- outliers --- multiobjective programming --- methods of quasi-Newton type --- Pareto optimality --- q-calculus --- rate of convergence --- wavelets on 3D ball --- uniform 3D grid --- volume preserving map --- Network --- graph drawing --- planar visualizations --- multiple root solvers --- composite method --- weight-function --- derivative-free method --- optimal convergence --- multivariate polynomial regression designs --- G-optimality --- D-optimality --- multiplicative algorithms --- G-efficiency --- Caratheodory-Tchakaloff discrete measure compression --- Non-Negative Least Squares --- accelerated Lawson-Hanson solver

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Numerical methods are a specific form of mathematics that involve creating and use of algorithms to map out the mathematical core of a practical problem. Numerical methods naturally find application in all fields of engineering, physical sciences, life sciences, social sciences, medicine, business, and even arts. The common uses of numerical methods include approximation, simulation, and estimation, and there is almost no scientific field in which numerical methods do not find a use. Results communicated here include topics ranging from statistics (Detecting Extreme Values with Order Statistics in Samples from Continuous Distributions) and Statistical software packages (dCATCH—A Numerical Package for d-Variate near G-Optimal Tchakaloff Regression via Fast NNLS) to new approaches for numerical solutions (Exact Solutions to the Maxmin Problem max‖Ax‖ Subject to ‖Bx‖≤1; On q-Quasi-Newton’s Method for Unconstrained Multiobjective Optimization Problems; Convergence Analysis and Complex Geometry of an Efficient Derivative-Free Iterative Method; On Derivative Free Multiple-Root Finders with Optimal Fourth Order Convergence; Finite Integration Method with Shifted Chebyshev Polynomials for Solving Time-Fractional Burgers’ Equations) to the use of wavelets (Orhonormal Wavelet Bases on The 3D Ball Via Volume Preserving Map from the Regular Octahedron) and methods for visualization (A Simple Method for Network Visualization).

Clenshaw–Curtis–Filon --- high oscillation --- singular integral equations --- boundary singularities --- local convergence --- nonlinear equations --- Banach space --- Fréchet-derivative --- finite integration method --- shifted Chebyshev polynomial --- Caputo fractional derivative --- Burgers’ equation --- coupled Burgers’ equation --- maxmin --- supporting vector --- matrix norm --- TMS coil --- optimal geolocation --- probability computing --- Monte Carlo simulation --- order statistics --- extreme values --- outliers --- multiobjective programming --- methods of quasi-Newton type --- Pareto optimality --- q-calculus --- rate of convergence --- wavelets on 3D ball --- uniform 3D grid --- volume preserving map --- Network --- graph drawing --- planar visualizations --- multiple root solvers --- composite method --- weight-function --- derivative-free method --- optimal convergence --- multivariate polynomial regression designs --- G-optimality --- D-optimality --- multiplicative algorithms --- G-efficiency --- Caratheodory-Tchakaloff discrete measure compression --- Non-Negative Least Squares --- accelerated Lawson-Hanson solver