Fixed Point Theory and Algorithms for Sciences and Engineering
Công bố khoa học tiêu biểu
* Dữ liệu chỉ mang tính chất tham khảo
Sắp xếp:
Strongly regular points of mappings
Fixed Point Theory and Algorithms for Sciences and Engineering - Tập 2021 - Trang 1-13 - 2021
In this paper, we use a robust lower directional derivative and provide some sufficient conditions to ensure the strong regularity of a given mapping at a certain point. Then, we discuss the Hoffman estimation and achieve some results for the estimate of the distance to the set of solutions to a system of linear equalities. The advantage of our estimate is that it allows one to calculate the coeff...... hiện toàn bộ
Extending Snow’s algorithm for computations in the finite Weyl groups
Fixed Point Theory and Algorithms for Sciences and Engineering - - 2023
In 1990, D. Snow proposed an effective algorithm for computing the orbits of finite Weyl groups. Snow’s algorithm is designed for computation of weights, W-orbits, and elements of the Weyl group. An extension of Snow’s algorithm is proposed, which allows to find pairs of mutually inverse elements together with the calculation of W-orbits in the same runtime cycle. This simplifies the calculation o...... hiện toàn bộ
Learning without loss
Fixed Point Theory and Algorithms for Sciences and Engineering - Tập 2021 - Trang 1-51 - 2021
We explore a new approach for training neural networks where all loss functions are replaced by hard constraints. The same approach is very successful in phase retrieval, where signals are reconstructed from magnitude constraints and general characteristics (sparsity, support, etc.). Instead of taking gradient steps, the optimizer in the constraint based approach, called relaxed–reflect–reflect (R...... hiện toàn bộ
Solution of a nonlinear fractional-order initial value problem via a $\mathscr{C}^{*}$ -algebra-valued $\mathcal{R}$ -metric space
Fixed Point Theory and Algorithms for Sciences and Engineering - - 2024
In this article, we prove new common fixed-point theorems on a
$\mathscr{C}^{*}$
-algebra-valued
$\mathcal{R}$
-metric space. An example is given based on our obtained results. To enhance our result...... hiện toàn bộ
A fixed point theorem for generalized $(\psi ,\varphi )$ -weak contractions in Branciari type generalized metric spaces
Fixed Point Theory and Algorithms for Sciences and Engineering - Tập 2021 - Trang 1-13 - 2021
In this paper, we obtain a new convergence theorem for fixed points of weak contractions in Branciari type generalized metric spaces under weaker conditions. The proof process of the theorem is new and different from that of other authors. An illustrative example of this theorem is to show how the new conditions extend known results.
String-averaging methods for best approximation to common fixed point sets of operators: the finite and infinite casesAbstract String-averaging is an algorithmic structure used when handling a family of operators in situations where the algorithm in hand requires to employ the operators in a specific order. Sequential orderings are well known, and a simultaneous order means that all operators are used simultaneously (in parallel). String-averaging allows to use strings of indices, ... ... hiện toàn bộ
Fixed Point Theory and Algorithms for Sciences and Engineering - - 2021
New Tseng’s extragradient methods for pseudomonotone variational inequality problems in Hadamard manifolds
Fixed Point Theory and Algorithms for Sciences and Engineering - Tập 2021 - Trang 1-20 - 2021
We propose Tseng’s extragradient methods for finding a solution of variational inequality problems associated with pseudomonotone vector fields in Hadamard manifolds. Under standard assumptions such as pseudomonotone and Lipschitz continuous vector fields, we prove that any sequence generated by the proposed methods converges to a solution of variational inequality problem, whenever it exits. More...... hiện toàn bộ
A priori error analysis of virtual element method for contact problem
Fixed Point Theory and Algorithms for Sciences and Engineering - Tập 2022 - Trang 1-12 - 2022
As an extension of the finite element method, the virtual element method (VEM) can handle very general polygonal meshes, making it very suitable for non-matching meshes. In (Wriggers et al. in Comput. Mech. 58:1039–1050, 2016), the lowest-order virtual element method was applied to solve the contact problem of two elastic bodies on non-matching meshes. The numerical experiments showed the robustne...... hiện toàn bộ
A new continuous hybrid block method with one optimal intrastep point through interpolation and collocation
Fixed Point Theory and Algorithms for Sciences and Engineering - Tập 2022 - Trang 1-17 - 2022
Implicit block approaches are used by a number of numerical analyzers to model mild, medium, and hard differential systems. Their excellent stability characteristics, self-starting nature, quick convergence, and large decrease in computing cost all contribute to their widespread application. With these numerical benefits in mind, a new one-step implicit block method with three intrastep grid point...... hiện toàn bộ
Well-posedness analysis of a stationary Navier–Stokes hemivariational inequalityAbstract This paper provides a well-posedness analysis for a hemivariational inequality of the stationary Navier-Stokes equations by arguments of convex minimization and the Banach fixed point. The hemivariational inequality describes a stationary incompressible fluid flow subject to a nonslip boundary condition and a Clarke subdifferential relation between the tota... ... hiện toàn bộ
Fixed Point Theory and Algorithms for Sciences and Engineering - - 2021
Tổng số: 57
- 1
- 2
- 3
- 4
- 5
- 6