Sign Up to like & get
recommendations!
0
Published in 2021 at "Journal of Computational Chemistry"
DOI: 10.1002/jcc.26472
Abstract: A local optimization algorithm for solving the Kohn–Sham equations is presented. It is based on a direct minimization of the energy functional under the equality constraints representing the Grassmann Manifold. The algorithm does not require…
read more here.
Keywords:
solving kohn;
algorithm solving;
kohn sham;
optimization algorithm ... See more keywords
Photo from wikipedia
Sign Up to like & get
recommendations!
0
Published in 2020 at "Neural Computing and Applications"
DOI: 10.1007/s00521-020-05124-x
Abstract: Meta-heuristic algorithms have been proposed to solve several optimization problems in different research areas due to their unique attractive features. Traditionally, heuristic approaches are designed separately for discrete and continuous problems. This paper leverages the…
read more here.
Keywords:
optimization problems;
algorithm solving;
volcano eruption;
optimization ... See more keywords
Sign Up to like & get
recommendations!
1
Published in 2019 at "Advances in Computational Mathematics"
DOI: 10.1007/s10444-019-09676-y
Abstract: In this paper, we propose and analyse a new unbiased stochastic approach for solving a class of integral equations. We study and compare the proposed unbiased approach against the known biased Monte Carlo method based…
read more here.
Keywords:
unbiased stochastic;
stochastic algorithm;
algorithm solving;
solving linear ... See more keywords
Sign Up to like & get
recommendations!
1
Published in 2020 at "Applied Intelligence"
DOI: 10.1007/s10489-020-01667-7
Abstract: This paper addresses the challenging problem of developing the automatic algorithm for solving direct current circuit problem. Leveraging on the innovated methods it proposes a high-performance relation based algorithm, called RaDCC. The challenges of the…
read more here.
Keywords:
current circuit;
algorithm solving;
relation;
direct current ... See more keywords
Photo from archive.org
Sign Up to like & get
recommendations!
1
Published in 2018 at "Numerical Algorithms"
DOI: 10.1007/s11075-018-0596-x
Abstract: The initiation of iterations and the encounters of all of its solutions are two of the main problems that are derived from iterative methods. These are produced within feasible regions where the problem lies. This…
read more here.
Keywords:
roots nonlinear;
algorithm solving;
new algorithm;
solving real ... See more keywords
Photo from wikipedia
Sign Up to like & get
recommendations!
2
Published in 2022 at "Numerical Algorithms"
DOI: 10.1007/s11075-021-01135-4
Abstract: Using iterative regularizations, we introduce a new proximal-like algorithm for solving split variational inclusion problems in Hilbert space and establish a strong convergence theorem for it. As applications, we also investigate the split feasibility and…
read more here.
Keywords:
split variational;
proximal like;
like algorithm;
algorithm solving ... See more keywords
Photo from archive.org
Sign Up to like & get
recommendations!
0
Published in 2021 at "Numerical Algorithms"
DOI: 10.1007/s11075-021-01154-1
Abstract: This article considers the numerical treatment of piecewise-smooth dynamical systems. Classical solutions as well as sliding modes up to codimension-2 are treated. An algorithm is presented that, in the case of non-uniqueness, selects a solution…
read more here.
Keywords:
piecewise smooth;
algorithm solving;
smooth dynamical;
efficient algorithm ... See more keywords
Sign Up to like & get
recommendations!
1
Published in 2019 at "Bulletin of the Malaysian Mathematical Sciences Society"
DOI: 10.1007/s40840-018-0614-0
Abstract: In this paper, we propose a CQ-type algorithm for solving the split feasibility problem (SFP) in real Hilbert spaces. The algorithm is designed such that the step-sizes are directly computed at each iteration. We will…
read more here.
Keywords:
split feasibility;
new algorithm;
hilbert spaces;
algorithm solving ... See more keywords
Sign Up to like & get
recommendations!
2
Published in 2021 at "Applied Ocean Research"
DOI: 10.1016/j.apor.2021.102846
Abstract: Abstract In two previous papers we presented an algorithm for coupling the Finite Volume (FV) method for the solution of 2D Navier–Stokes equations discretized on block structured Eulerian grids with the weakly-compressible Lagrangian Smoothed Particle…
read more here.
Keywords:
sph coupling;
coupling algorithm;
surface;
free surface ... See more keywords
Photo from archive.org
Sign Up to like & get
recommendations!
0
Published in 2020 at "Chemical Physics Letters"
DOI: 10.1016/j.cplett.2020.137651
Abstract: Abstract In this paper, we discuss a higher order quartic trigonometric B-spline collocation method on a uniform mesh for solving two special models of Lane-Emden boundary value problems. The error analysis and stability of the…
read more here.
Keywords:
non isothermal;
new spline;
spline algorithm;
isothermal reaction ... See more keywords
Sign Up to like & get
recommendations!
0
Published in 2018 at "Electronics Letters"
DOI: 10.1049/el.2017.4544
Abstract: An accelerated version of the proximal stochastic dual coordinate ascent (SDCA) algorithm in solving regularised loss minimisation with l 2 norm is presented, wherein a momentum is introduced and the strong theoretical guarantees of SDCA…
read more here.
Keywords:
solving regularised;
proximal stochastic;
coordinate ascent;
dual coordinate ... See more keywords