The following paper presents one way to define and classify the fractional pseudo-Newton method through a group of fractional matrix operators, as well as a code written in recursive programming to implement this
method, which through minor modifications, can be implemented in any fractional fixed-point method that allows
solving nonlinear algebraic equation systems.
Code of the Multidimensional Fractional Quasi-Newton Method using Recursive P...mathsjournal
The following paper presents one way to define and classify the fractional quasi-Newton method through a group of fractional matrix operators, as well as a code written in recursive programming to implement this method, which through minor modifications, can be implemented in any fractional fixed-point method that allows solving nonlinear algebraic equation systems.
Exact Quasi-Classical Asymptoticbeyond Maslov Canonical Operator and Quantum ...ijrap
This document discusses exact quasi-classical asymptotic solutions to the Schrodinger equation beyond the WKB and Maslov canonical operator approximations. It presents Colombeau solutions to the Schrodinger equation that can explain the nature of quantum jumps without additional postulates. The solutions are represented using path integral formulations involving Feynman propagators and Maslov canonical operators. Limiting quantum trajectories and averages are defined from the Colombeau solutions that correspond to measurement outcomes, providing an explanation for quantum jumps from the Schrodinger equation alone.
(α ψ)- Construction with q- function for coupled fixed pointAlexander Decker
This document presents a theorem to prove the existence of coupled fixed points for contractive mappings in partially ordered quasi-metric spaces. It begins with definitions of key concepts such as mixed monotone mappings, coupled fixed points, quasi-metric spaces, and Q-functions. It then states and proves a coupled fixed point theorem for mappings that satisfy an (α-Ψ)-contractive condition in a partially ordered, complete quasi-metric space with a Q-function. The theorem shows that if such a mapping F has the mixed monotone property and satisfies the contractive inequality, then F has at least one coupled fixed point.
This summary provides the key details from the document in 3 sentences:
The document presents a new iterative method (M2 method) for determining the exact solution to a parametric linear programming problem where the objective function and constraints contain parameters. The M2 method exploits the concept of a p-solution to a square linear interval parametric system and iteratively reduces the parameter domain while maintaining upper and lower bounds on the optimal objective value. A numerical example is given to illustrate the new iterative approach for solving parametric linear programming problems.
Application of the Monte-Carlo Method to Nonlinear Stochastic Optimization wi...SSA KPI
This document describes a method for solving nonlinear stochastic optimization problems with linear constraints using Monte Carlo estimators. The key aspects are:
1) An ε-feasible solution approach is used to avoid "jamming" or "zigzagging" when dealing with linear constraints.
2) The optimality of solutions is tested statistically using the asymptotic normality of Monte Carlo estimators.
3) The Monte Carlo sample size is adjusted iteratively based on the gradient estimate to decrease computational trials while maintaining solution accuracy.
4) Under certain conditions, the method is proven to converge almost surely to a stationary point of the optimization problem.
5) As an example, the method is applied to portfolio optimization with
This paper defines a class of functions represented by generalized Dirichlet series whose coefficients satisfy certain conditions. The region of convergence depends on the fixed Dirichlet series. This class of functions forms a complete normed linear space called Ω(u,p) with an inner product. It is proven that Ω(u,p) is a Banach space for 1≤p<∞ but not a Hilbert space unless p=2. A Schauder basis is obtained for Ω(u,p) as the set of functions {±kkesλk} where λk are the exponents of the fixed Dirichlet series.
Existence Theory for Second Order Nonlinear Functional Random Differential Eq...IOSR Journals
This document presents an existence theory for solutions to second order nonlinear functional random differential equations in Banach algebras. It begins by introducing the type of random differential equation being studied and defining relevant function spaces. It then states several theorems and lemmas from previous works that will be used to prove the main results. The paper goes on to prove that under certain Lipschitz conditions and boundedness assumptions on the operators defining the equation, the random differential equation has at least one random solution in the given function space. It also shows that the set of such random solutions is compact. The results generalize previous existence theorems to the random case.
This document provides estimates for several number theory functions without assuming the Riemann Hypothesis (RH), including bounds for ψ(x), θ(x), and the kth prime number pk. The following estimates are derived:
1) θ(x) - x < 1/36,260x for x > 0.
2) |θ(x) - x| < ηk x/lnkx for certain values of x, where ηk decreases as k increases.
3) Estimates are obtained for θ(pk), the value of θ at the kth prime number pk, showing θ(pk) is approximately k ln k + ln2 k - 1.
Code of the Multidimensional Fractional Quasi-Newton Method using Recursive P...mathsjournal
The following paper presents one way to define and classify the fractional quasi-Newton method through a group of fractional matrix operators, as well as a code written in recursive programming to implement this method, which through minor modifications, can be implemented in any fractional fixed-point method that allows solving nonlinear algebraic equation systems.
Exact Quasi-Classical Asymptoticbeyond Maslov Canonical Operator and Quantum ...ijrap
This document discusses exact quasi-classical asymptotic solutions to the Schrodinger equation beyond the WKB and Maslov canonical operator approximations. It presents Colombeau solutions to the Schrodinger equation that can explain the nature of quantum jumps without additional postulates. The solutions are represented using path integral formulations involving Feynman propagators and Maslov canonical operators. Limiting quantum trajectories and averages are defined from the Colombeau solutions that correspond to measurement outcomes, providing an explanation for quantum jumps from the Schrodinger equation alone.
(α ψ)- Construction with q- function for coupled fixed pointAlexander Decker
This document presents a theorem to prove the existence of coupled fixed points for contractive mappings in partially ordered quasi-metric spaces. It begins with definitions of key concepts such as mixed monotone mappings, coupled fixed points, quasi-metric spaces, and Q-functions. It then states and proves a coupled fixed point theorem for mappings that satisfy an (α-Ψ)-contractive condition in a partially ordered, complete quasi-metric space with a Q-function. The theorem shows that if such a mapping F has the mixed monotone property and satisfies the contractive inequality, then F has at least one coupled fixed point.
This summary provides the key details from the document in 3 sentences:
The document presents a new iterative method (M2 method) for determining the exact solution to a parametric linear programming problem where the objective function and constraints contain parameters. The M2 method exploits the concept of a p-solution to a square linear interval parametric system and iteratively reduces the parameter domain while maintaining upper and lower bounds on the optimal objective value. A numerical example is given to illustrate the new iterative approach for solving parametric linear programming problems.
Application of the Monte-Carlo Method to Nonlinear Stochastic Optimization wi...SSA KPI
This document describes a method for solving nonlinear stochastic optimization problems with linear constraints using Monte Carlo estimators. The key aspects are:
1) An ε-feasible solution approach is used to avoid "jamming" or "zigzagging" when dealing with linear constraints.
2) The optimality of solutions is tested statistically using the asymptotic normality of Monte Carlo estimators.
3) The Monte Carlo sample size is adjusted iteratively based on the gradient estimate to decrease computational trials while maintaining solution accuracy.
4) Under certain conditions, the method is proven to converge almost surely to a stationary point of the optimization problem.
5) As an example, the method is applied to portfolio optimization with
This paper defines a class of functions represented by generalized Dirichlet series whose coefficients satisfy certain conditions. The region of convergence depends on the fixed Dirichlet series. This class of functions forms a complete normed linear space called Ω(u,p) with an inner product. It is proven that Ω(u,p) is a Banach space for 1≤p<∞ but not a Hilbert space unless p=2. A Schauder basis is obtained for Ω(u,p) as the set of functions {±kkesλk} where λk are the exponents of the fixed Dirichlet series.
Existence Theory for Second Order Nonlinear Functional Random Differential Eq...IOSR Journals
This document presents an existence theory for solutions to second order nonlinear functional random differential equations in Banach algebras. It begins by introducing the type of random differential equation being studied and defining relevant function spaces. It then states several theorems and lemmas from previous works that will be used to prove the main results. The paper goes on to prove that under certain Lipschitz conditions and boundedness assumptions on the operators defining the equation, the random differential equation has at least one random solution in the given function space. It also shows that the set of such random solutions is compact. The results generalize previous existence theorems to the random case.
This document provides estimates for several number theory functions without assuming the Riemann Hypothesis (RH), including bounds for ψ(x), θ(x), and the kth prime number pk. The following estimates are derived:
1) θ(x) - x < 1/36,260x for x > 0.
2) |θ(x) - x| < ηk x/lnkx for certain values of x, where ηk decreases as k increases.
3) Estimates are obtained for θ(pk), the value of θ at the kth prime number pk, showing θ(pk) is approximately k ln k + ln2 k - 1.
This document summarizes several papers on principal component analysis (PCA) with network/graph constraints. It discusses graph-Laplacian PCA (gLPCA) which adds a graph smoothness regularization term to standard PCA. It also covers robust graph-Laplacian PCA (RgLPCA) which uses an L2,1 norm and iterative algorithms. Further, it summarizes robust PCA on graphs which learns the product of principal directions and components while assuming smoothness on this product. Finally, it discusses manifold regularized matrix factorization (MMF) which imposes orthonormal constraints on principal directions.
Reproducing Kernel Hilbert Space of A Set Indexed Brownian MotionIJMERJOURNAL
ABSTRACT: This study researches a representation of set indexed Brownian motion { : } X X A A A via orthonormal basis, based on reproducing kernel Hilbert space (RKHS). The RKHS associated with the set indexed Brownian motion X is a Hilbert space of real-valued functions on T that is naturally isometric to 2 L ( ) A . The isometry between these Hilbert spaces leads to useful spectral representations of the set indexed Brownian motion, notably the Karhunen-Loève (KL) representation: [ ] X e E X e A n A n where { }n e is an orthonormal sequence of centered Gaussian variables. In addition, we present two special cases of a representation of a set indexed Brownian motion, when ([0,1] ) d A A and A = A( ) Ls .
To give the complete list of Uq(sl2)-actions of the quantum plane, we first obtain the structure of quantum plane automorphisms. Then we introduce some special symbolic matrices to classify the series of actions using the weights. There are uncountably many isomorphism classes of the symmetries. We give the classical limit of the above actions.
Robust Image Denoising in RKHS via Orthogonal Matching PursuitPantelis Bouboulis
We present a robust method for the image denoising task based on kernel ridge regression and sparse modeling. Added noise is assumed to consist of two parts. One part is impulse noise assumed to be sparse (outliers), while the other part is bounded noise. The noisy image is divided into small regions of interest, whose pixels are regarded as points of a two-dimensional surface. A kernel based ridge regression method, whose parameters are selected adaptively, is employed to fit the data, whereas the outliers are detected via the use of the increasingly popular orthogonal matching pursuit (OMP) algorithm. To this end, a new variant of the OMP rationale is employed that has the additional advantage to automatically terminate, when all outliers have been selected.
The document provides an overview of concepts in functional analysis that will be covered in a math camp, including: function spaces, metric spaces, dense subsets, linear spaces, linear functionals, norms, Euclidean spaces, orthogonality, separable spaces, complete metric spaces, Hilbert spaces, and convex functions. Examples are given for each concept to illustrate the definitions.
Iterative procedure for uniform continuous mapping.Alexander Decker
This document presents an iterative procedure for finding a common fixed point of a finite family of self-maps on a nonempty closed convex subset of a normed linear space. Specifically:
1. It defines an m-step iterative process that generates a sequence from an initial point by applying m self-maps from the family sequentially at each step.
2. It proves that if one of the maps is uniformly continuous and hemicontractive, with bounded range, and the family has a nonempty common fixed point set, then the iterative sequence converges strongly to a common fixed point.
3. It extends previous results by allowing some maps in the family to satisfy only asymptotic conditions, rather than uniform continuity. The conditions
The document provides a summary of Chapter 1 and Chapter 2 from a Class XII Maths textbook. Chapter 1 discusses relations and functions, including whether certain binary operations are commutative, evaluating functions, and determining if functions are injective or surjective. Chapter 2 covers inverse trigonometric functions, including evaluating various inverse trig expressions and proving identities about inverse trig functions.
Reachability Analysis Control of Non-Linear Dynamical SystemsM Reza Rahmati
The document summarizes an approach for algorithmically synthesizing control strategies for discrete-time nonlinear uncertain systems based on reachable set computations using ellipsoidal calculus. The method uses a first-order Taylor approximation of the nonlinear dynamics combined with a conservative approximation of the Lagrange remainder to transform the system into an affine form. The reachable sets are then over-approximated using ellipsoidal operations, allowing the application of ellipsoidal calculus techniques. An iterative algorithm is proposed to compute stabilizing controllers by solving constrained optimization problems at each step to drive the system to a terminal ellipsoidal set within a finite number of steps while satisfying input constraints.
Reachability Analysis "Control Of Dynamical Non-Linear Systems" M Reza Rahmati
The document summarizes an approach for algorithmically synthesizing control strategies for discrete-time nonlinear uncertain systems based on reachable set computations using ellipsoidal calculus. The method uses a first-order Taylor approximation of the nonlinear dynamics combined with a conservative approximation of the Lagrange remainder to transform the system into an affine form. The reachable sets are then over-approximated using ellipsoidal operations. An iterative algorithm is proposed to compute stabilizing controllers by solving constrained optimization problems to drive the system state into a target ellipsoidal set within a finite number of steps while satisfying input constraints.
This document discusses linear multistep methods for solving initial value differential problems. It makes three key points:
1) Linear multistep methods can be viewed as fixed point iterative methods with a differential operator instead of an integral operator. They converge to a fixed point if consistent and stable.
2) The document proves that any linear multistep method defines a contraction mapping, ensuring convergence to a unique fixed point when the problem is Lipschitz continuous.
3) Examples of explicit and implicit linear multistep methods are given, along with their fixed point iterative formulations. These include Euler's method, trapezoidal method, and Adams-Moulton method.
This document defines deterministic finite automata (DFAs) and discusses their components, representations, operations, and properties. A DFA consists of a finite set of states, a finite alphabet, a transition function, a start state, and a set of accepting/final states. DFAs can be represented by transition tables or diagrams. The product and complement operations on DFAs are defined, and it is shown that these preserve regularity of languages. The accessible and minimal parts of a DFA are also discussed.
Nonlinear Stochastic Optimization by the Monte-Carlo MethodSSA KPI
This document describes a method for solving stochastic optimization problems using Monte Carlo simulation. It introduces Monte Carlo estimators for the objective function, its gradient, and the covariance matrix that can be computed using a random sample. It then presents an iterative stochastic gradient descent procedure where the sample size is adjusted at each iteration inversely proportional to the square of the gradient estimate. Two theorems prove that this approach ensures convergence to the optimal solution and provides accuracy bounds on the estimate of the distance to the optimal point. The method offers a way to efficiently solve stochastic optimization problems using adaptive sample sizes.
This document discusses using bootstrap methods to create confidence intervals for time series forecasts. It provides examples of time series data and introduces the AR(1) model. The document describes an algorithm for calculating a bootstrap confidence interval for forecasting from an AR(1) model. It then discusses a simulation study comparing empirical coverage rates of bootstrap confidence intervals under different parameters. Finally, it applies the bootstrap method to forecasting Gross National Product growth, comparing the results to a parametric approach.
This document discusses using bootstrap methods to create confidence intervals for time series forecasts. It provides background on time series models and the autoregressive (AR) process. It then presents an algorithm for calculating a bootstrap confidence interval for forecasts from an AR(1) model. A simulation study compares coverage rates for bootstrap confidence intervals under different parameters. Finally, the method is applied to US Gross National Product data to forecast and construct confidence intervals.
Conformable Chebyshev differential equation of first kindIJECEIAES
In this paper, the Chebyshev-I conformable differential equation is considered. A proper power series is examined; there are two solutions, the even solution and the odd solution. The Rodrigues’ type formula is also allocated for the conformable Chebyshev-I polynomials.
This document contains exercises related to dynamical systems and periodic points. It includes the following summaries:
1. The doubling map on the circle has 2n-1 periodic points of period n. Its periodic points are dense.
2. The map f(x)=|x-2| has a fixed point at x=1. Other periodic and pre-periodic points are [0,2]\{1\} of period 2 and (-∞,0)∪(2,+∞) which are pre-periodic.
3. Expanding maps of the circle are topologically mixing since intervals get longer under iteration, eventually covering the entire circle.
OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...mathsjournal
Speaker diarization is a critical task in speech processing that aims to identify "who spoke when?" in an
audio or video recording that contains unknown amounts of speech from unknown speakers and unknown
number of speakers. Diarization has numerous applications in speech recognition, speaker identification,
and automatic captioning. Supervised and unsupervised algorithms are used to address speaker diarization
problems, but providing exhaustive labeling for the training dataset can become costly in supervised
learning, while accuracy can be compromised when using unsupervised approaches. This paper presents a
novel approach to speaker diarization, which defines loosely labeled data and employs x-vector embedding
and a formalized approach for threshold searching with a given abstract similarity metric to cluster
temporal segments into unique user segments. The proposed algorithm uses concepts of graph theory,
matrix algebra, and genetic algorithm to formulate and solve the optimization problem. Additionally, the
algorithm is applied to English, Spanish, and Chinese audios, and the performance is evaluated using wellknown similarity metrics. The results demonstrate that the robustness of the proposed approach. The
findings of this research have significant implications for speech processing, speaker identification
including those with tonal differences. The proposed method offers a practical and efficient solution for
speaker diarization in real-world scenarios where there are labeling time and cost constraints.
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...mathsjournal
We present herein a new approach to the Continuum hypothesis CH. We will employ a string conditioning,
a technique that limits the range of a string over some of its sub-domains for forming subsets K of R. We
will prove that these are well defined and in fact proper subsets of R by making use of Cantor’s Diagonal
argument in its original form to establish the cardinality of K between that of (N,R) respectively
More Related Content
Similar to Code of the multidimensional fractional pseudo-Newton method using recursive programming
This document summarizes several papers on principal component analysis (PCA) with network/graph constraints. It discusses graph-Laplacian PCA (gLPCA) which adds a graph smoothness regularization term to standard PCA. It also covers robust graph-Laplacian PCA (RgLPCA) which uses an L2,1 norm and iterative algorithms. Further, it summarizes robust PCA on graphs which learns the product of principal directions and components while assuming smoothness on this product. Finally, it discusses manifold regularized matrix factorization (MMF) which imposes orthonormal constraints on principal directions.
Reproducing Kernel Hilbert Space of A Set Indexed Brownian MotionIJMERJOURNAL
ABSTRACT: This study researches a representation of set indexed Brownian motion { : } X X A A A via orthonormal basis, based on reproducing kernel Hilbert space (RKHS). The RKHS associated with the set indexed Brownian motion X is a Hilbert space of real-valued functions on T that is naturally isometric to 2 L ( ) A . The isometry between these Hilbert spaces leads to useful spectral representations of the set indexed Brownian motion, notably the Karhunen-Loève (KL) representation: [ ] X e E X e A n A n where { }n e is an orthonormal sequence of centered Gaussian variables. In addition, we present two special cases of a representation of a set indexed Brownian motion, when ([0,1] ) d A A and A = A( ) Ls .
To give the complete list of Uq(sl2)-actions of the quantum plane, we first obtain the structure of quantum plane automorphisms. Then we introduce some special symbolic matrices to classify the series of actions using the weights. There are uncountably many isomorphism classes of the symmetries. We give the classical limit of the above actions.
Robust Image Denoising in RKHS via Orthogonal Matching PursuitPantelis Bouboulis
We present a robust method for the image denoising task based on kernel ridge regression and sparse modeling. Added noise is assumed to consist of two parts. One part is impulse noise assumed to be sparse (outliers), while the other part is bounded noise. The noisy image is divided into small regions of interest, whose pixels are regarded as points of a two-dimensional surface. A kernel based ridge regression method, whose parameters are selected adaptively, is employed to fit the data, whereas the outliers are detected via the use of the increasingly popular orthogonal matching pursuit (OMP) algorithm. To this end, a new variant of the OMP rationale is employed that has the additional advantage to automatically terminate, when all outliers have been selected.
The document provides an overview of concepts in functional analysis that will be covered in a math camp, including: function spaces, metric spaces, dense subsets, linear spaces, linear functionals, norms, Euclidean spaces, orthogonality, separable spaces, complete metric spaces, Hilbert spaces, and convex functions. Examples are given for each concept to illustrate the definitions.
Iterative procedure for uniform continuous mapping.Alexander Decker
This document presents an iterative procedure for finding a common fixed point of a finite family of self-maps on a nonempty closed convex subset of a normed linear space. Specifically:
1. It defines an m-step iterative process that generates a sequence from an initial point by applying m self-maps from the family sequentially at each step.
2. It proves that if one of the maps is uniformly continuous and hemicontractive, with bounded range, and the family has a nonempty common fixed point set, then the iterative sequence converges strongly to a common fixed point.
3. It extends previous results by allowing some maps in the family to satisfy only asymptotic conditions, rather than uniform continuity. The conditions
The document provides a summary of Chapter 1 and Chapter 2 from a Class XII Maths textbook. Chapter 1 discusses relations and functions, including whether certain binary operations are commutative, evaluating functions, and determining if functions are injective or surjective. Chapter 2 covers inverse trigonometric functions, including evaluating various inverse trig expressions and proving identities about inverse trig functions.
Reachability Analysis Control of Non-Linear Dynamical SystemsM Reza Rahmati
The document summarizes an approach for algorithmically synthesizing control strategies for discrete-time nonlinear uncertain systems based on reachable set computations using ellipsoidal calculus. The method uses a first-order Taylor approximation of the nonlinear dynamics combined with a conservative approximation of the Lagrange remainder to transform the system into an affine form. The reachable sets are then over-approximated using ellipsoidal operations, allowing the application of ellipsoidal calculus techniques. An iterative algorithm is proposed to compute stabilizing controllers by solving constrained optimization problems at each step to drive the system to a terminal ellipsoidal set within a finite number of steps while satisfying input constraints.
Reachability Analysis "Control Of Dynamical Non-Linear Systems" M Reza Rahmati
The document summarizes an approach for algorithmically synthesizing control strategies for discrete-time nonlinear uncertain systems based on reachable set computations using ellipsoidal calculus. The method uses a first-order Taylor approximation of the nonlinear dynamics combined with a conservative approximation of the Lagrange remainder to transform the system into an affine form. The reachable sets are then over-approximated using ellipsoidal operations. An iterative algorithm is proposed to compute stabilizing controllers by solving constrained optimization problems to drive the system state into a target ellipsoidal set within a finite number of steps while satisfying input constraints.
This document discusses linear multistep methods for solving initial value differential problems. It makes three key points:
1) Linear multistep methods can be viewed as fixed point iterative methods with a differential operator instead of an integral operator. They converge to a fixed point if consistent and stable.
2) The document proves that any linear multistep method defines a contraction mapping, ensuring convergence to a unique fixed point when the problem is Lipschitz continuous.
3) Examples of explicit and implicit linear multistep methods are given, along with their fixed point iterative formulations. These include Euler's method, trapezoidal method, and Adams-Moulton method.
This document defines deterministic finite automata (DFAs) and discusses their components, representations, operations, and properties. A DFA consists of a finite set of states, a finite alphabet, a transition function, a start state, and a set of accepting/final states. DFAs can be represented by transition tables or diagrams. The product and complement operations on DFAs are defined, and it is shown that these preserve regularity of languages. The accessible and minimal parts of a DFA are also discussed.
Nonlinear Stochastic Optimization by the Monte-Carlo MethodSSA KPI
This document describes a method for solving stochastic optimization problems using Monte Carlo simulation. It introduces Monte Carlo estimators for the objective function, its gradient, and the covariance matrix that can be computed using a random sample. It then presents an iterative stochastic gradient descent procedure where the sample size is adjusted at each iteration inversely proportional to the square of the gradient estimate. Two theorems prove that this approach ensures convergence to the optimal solution and provides accuracy bounds on the estimate of the distance to the optimal point. The method offers a way to efficiently solve stochastic optimization problems using adaptive sample sizes.
This document discusses using bootstrap methods to create confidence intervals for time series forecasts. It provides examples of time series data and introduces the AR(1) model. The document describes an algorithm for calculating a bootstrap confidence interval for forecasting from an AR(1) model. It then discusses a simulation study comparing empirical coverage rates of bootstrap confidence intervals under different parameters. Finally, it applies the bootstrap method to forecasting Gross National Product growth, comparing the results to a parametric approach.
This document discusses using bootstrap methods to create confidence intervals for time series forecasts. It provides background on time series models and the autoregressive (AR) process. It then presents an algorithm for calculating a bootstrap confidence interval for forecasts from an AR(1) model. A simulation study compares coverage rates for bootstrap confidence intervals under different parameters. Finally, the method is applied to US Gross National Product data to forecast and construct confidence intervals.
Conformable Chebyshev differential equation of first kindIJECEIAES
In this paper, the Chebyshev-I conformable differential equation is considered. A proper power series is examined; there are two solutions, the even solution and the odd solution. The Rodrigues’ type formula is also allocated for the conformable Chebyshev-I polynomials.
This document contains exercises related to dynamical systems and periodic points. It includes the following summaries:
1. The doubling map on the circle has 2n-1 periodic points of period n. Its periodic points are dense.
2. The map f(x)=|x-2| has a fixed point at x=1. Other periodic and pre-periodic points are [0,2]\{1\} of period 2 and (-∞,0)∪(2,+∞) which are pre-periodic.
3. Expanding maps of the circle are topologically mixing since intervals get longer under iteration, eventually covering the entire circle.
Similar to Code of the multidimensional fractional pseudo-Newton method using recursive programming (20)
OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...mathsjournal
Speaker diarization is a critical task in speech processing that aims to identify "who spoke when?" in an
audio or video recording that contains unknown amounts of speech from unknown speakers and unknown
number of speakers. Diarization has numerous applications in speech recognition, speaker identification,
and automatic captioning. Supervised and unsupervised algorithms are used to address speaker diarization
problems, but providing exhaustive labeling for the training dataset can become costly in supervised
learning, while accuracy can be compromised when using unsupervised approaches. This paper presents a
novel approach to speaker diarization, which defines loosely labeled data and employs x-vector embedding
and a formalized approach for threshold searching with a given abstract similarity metric to cluster
temporal segments into unique user segments. The proposed algorithm uses concepts of graph theory,
matrix algebra, and genetic algorithm to formulate and solve the optimization problem. Additionally, the
algorithm is applied to English, Spanish, and Chinese audios, and the performance is evaluated using wellknown similarity metrics. The results demonstrate that the robustness of the proposed approach. The
findings of this research have significant implications for speech processing, speaker identification
including those with tonal differences. The proposed method offers a practical and efficient solution for
speaker diarization in real-world scenarios where there are labeling time and cost constraints.
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...mathsjournal
We present herein a new approach to the Continuum hypothesis CH. We will employ a string conditioning,
a technique that limits the range of a string over some of its sub-domains for forming subsets K of R. We
will prove that these are well defined and in fact proper subsets of R by making use of Cantor’s Diagonal
argument in its original form to establish the cardinality of K between that of (N,R) respectively
A Positive Integer 𝑵 Such That 𝒑𝒏 + 𝒑𝒏+𝟑 ~ 𝒑𝒏+𝟏 + 𝒑𝒏+𝟐 For All 𝒏 ≥ 𝑵mathsjournal
According to Bertrand's postulate, we have 𝑝𝑛 + 𝑝𝑛 ≥ 𝑝𝑛+1. Is it true that for all 𝑛 > 1 then 𝑝𝑛−1 + 𝑝𝑛 ≥𝑝𝑛+1? Then 𝑝𝑛 + 𝑝𝑛+3 > 𝑝𝑛+1 + 𝑝𝑛+2where 𝑛 ≥ 𝑁, 𝑁 is a large enough value?
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...mathsjournal
We present herein a new approach to the Continuum hypothesis CH. We will employ a string conditioning,
a technique that limits the range of a string over some of its sub-domains for forming subsets K of R. We
will prove that these are well defined and in fact proper subsets of R by making use of Cantor’s Diagonal
argument in its original form to establish the cardinality of K between that of (N,R) respectively.
Moving Target Detection Using CA, SO and GO-CFAR detectors in Nonhomogeneous ...mathsjournal
systems in complex situations. A fundamental problem in radar systems is to automatically detect targets while maintaining a
desired constant false alarm probability. This work studies two detection approaches, the first with a fixed threshold and the
other with an adaptive one. In the latter, we have learned the three types of detectors CA, SO, and GO-CFAR. This research
aims to apply intelligent techniques to improve detection performance in a nonhomogeneous environment using standard
CFAR detectors. The objective is to maintain the false alarm probability and enhance target detection by combining
intelligent techniques. With these objectives in mind, implementing standard CFAR detectors is applied to nonhomogeneous
environment data. The primary focus is understanding the reason for the false detection when applying standard CFAR
detectors in a nonhomogeneous environment and how to avoid it using intelligent approaches.
OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...mathsjournal
Speaker diarization is a critical task in speech processing that aims to identify "who spoke when?" in an
audio or video recording that contains unknown amounts of speech from unknown speakers and unknown
number of speakers. Diarization has numerous applications in speech recognition, speaker identification,
and automatic captioning. Supervised and unsupervised algorithms are used to address speaker diarization
problems, but providing exhaustive labeling for the training dataset can become costly in supervised
learning, while accuracy can be compromised when using unsupervised approaches. This paper presents a
novel approach to speaker diarization, which defines loosely labeled data and employs x-vector embedding
and a formalized approach for threshold searching with a given abstract similarity metric to cluster
temporal segments into unique user segments. The proposed algorithm uses concepts of graph theory,
matrix algebra, and genetic algorithm to formulate and solve the optimization problem. Additionally, the
algorithm is applied to English, Spanish, and Chinese audios, and the performance is evaluated using wellknown similarity metrics. The results demonstrate that the robustness of the proposed approach. The
findings of this research have significant implications for speech processing, speaker identification
including those with tonal differences. The proposed method offers a practical and efficient solution for
speaker diarization in real-world scenarios where there are labeling time and cost constraints.
The Impact of Allee Effect on a Predator-Prey Model with Holling Type II Func...mathsjournal
There is currently much interest in predator–prey models across a variety of bioscientific disciplines. The focus is on quantifying predator–prey interactions, and this quantification is being formulated especially as regards climate change. In this article, a stability analysis is used to analyse the behaviour of a general two-species model with respect to the Allee effect (on the growth rate and nutrient limitation level of the prey population). We present a description of the local and non-local interaction stability of the model and detail the types of bifurcation which arise, proving that there is a Hopf bifurcation in the Allee effect module. A stable periodic oscillation was encountered which was due to the Allee effect on the
prey species. As a result of this, the positive equilibrium of the model could change from stable to unstable and then back to stable, as the strength of the Allee effect (or the ‘handling’ time taken by predators when predating) increased continuously from zero. Hopf bifurcation has arose yield some complex patterns that have not been observed previously in predator-prey models, and these, at the same time, reflect long term behaviours. These findings have significant implications for ecological studies, not least with respect to examining the mobility of the two species involved in the non-local domain using Turing instability. A spiral generated by local interaction (reflecting the instability that forms even when an infinitely large
carrying capacity is assumed) is used in the model.
A POSSIBLE RESOLUTION TO HILBERT’S FIRST PROBLEM BY APPLYING CANTOR’S DIAGONA...mathsjournal
We present herein a new approach to the Continuum hypothesis CH. We will employ a string conditioning,a technique that limits the range of a string over some of its sub-domains for forming subsets K of R. We will prove that these are well defined and in fact proper subsets of R by making use of Cantor’s Diagonal argument in its original form to establish the cardinality of K between that of (N,R) respectively.
Moving Target Detection Using CA, SO and GO-CFAR detectors in Nonhomogeneous ...mathsjournal
Modernization of radar technology and improved signal processing techniques are necessary to improve detection systems in complex situations. A fundamental problem in radar systems is to automatically detect targets while maintaining a
desired constant false alarm probability. This work studies two detection approaches, the first with a fixed threshold and the
other with an adaptive one. In the latter, we have learned the three types of detectors CA, SO, and GO-CFAR. This research
aims to apply intelligent techniques to improve detection performance in a nonhomogeneous environment using standard
CFAR detectors. The objective is to maintain the false alarm probability and enhance target detection by combining
intelligent techniques. With these objectives in mind, implementing standard CFAR detectors is applied to nonhomogeneous
environment data. The primary focus is understanding the reason for the false detection when applying standard CFAR
detectors in a nonhomogeneous environment and how to avoid it using intelligent approaches
OPTIMIZING SIMILARITY THRESHOLD FOR ABSTRACT SIMILARITY METRIC IN SPEECH DIAR...mathsjournal
Speaker diarization is a critical task in speech processing that aims to identify "who spoke when?" in an
audio or video recording that contains unknown amounts of speech from unknown speakers and unknown
number of speakers. Diarization has numerous applications in speech recognition, speaker identification,
and automatic captioning. Supervised and unsupervised algorithms are used to address speaker diarization
problems, but providing exhaustive labeling for the training dataset can become costly in supervised
learning, while accuracy can be compromised when using unsupervised approaches. This paper presents a
novel approach to speaker diarization, which defines loosely labeled data and employs x-vector embedding
and a formalized approach for threshold searching with a given abstract similarity metric to cluster
temporal segments into unique user segments. The proposed algorithm uses concepts of graph theory,
matrix algebra, and genetic algorithm to formulate and solve the optimization problem. Additionally, the
algorithm is applied to English, Spanish, and Chinese audios, and the performance is evaluated using wellknown similarity metrics. The results demonstrate that the robustness of the proposed approach. The
findings of this research have significant implications for speech processing, speaker identification
including those with tonal differences. The proposed method offers a practical and efficient solution for
speaker diarization in real-world scenarios where there are labeling time and cost constraints
Modified Alpha-Rooting Color Image Enhancement Method on the Two Side 2-D Qua...mathsjournal
Color in an image is resolved to 3 or 4 color components and 2-Dimages of these components are stored in separate channels. Most of the color image enhancement algorithms are applied channel-by-channel on each image. But such a system of color image processing is not processing the original color. When a color image is represented as a quaternion image, processing is done in original colors. This paper proposes an implementation of the quaternion approach of enhancement algorithm for enhancing color images and is referred as the modified alpha-rooting by the two-dimensional quaternion discrete Fourier transform (2-D QDFT). Enhancement results of this proposed method are compared with the channel-by-channel image enhancement by the 2-D DFT. Enhancements in color images are quantitatively measured by the color enhancement measure estimation (CEME), which allows for selecting optimum parameters for processing by thegenetic algorithm. Enhancement of color images by the quaternion based method allows for obtaining images which are closer to the genuine representation of the real original color.
An Application of Assignment Problem in Laptop Selection Problem Using MATLABmathsjournal
The assignment – selection problem used to find one-to- one match of given “Users” to “Laptops”, the main objective is to minimize the cost as per user requirement. This paper presents satisfactory solution for real assignment – Laptop selection problem using MATLAB coding.
The aim of this paper is to study the class of β-normal spaces. The relationships among s-normal spaces, pnormal spaces and β-normal spaces are investigated. Moreover, we study the forms of generalized β-closed
functions. We obtain characterizations of β-normal spaces, properties of the forms of generalized β-closed
functions and preservation theorems.
Cubic Response Surface Designs Using Bibd in Four Dimensionsmathsjournal
Response Surface Methodology (RSM) has applications in Chemical, Physical, Meteorological, Industrial and Biological fields. The estimation of slope response surface occurs frequently in practical situations for the experimenter. The rates of change of the response surface, like rates of change in the yield of crop to various fertilizers, to estimate the rates of change in chemical experiments etc. are of
interest. If the fit of second order response is inadequate for the design points, we continue the
experiment so as to fit a third order response surface. Higher order response surface designs are sometimes needed in Industrial and Meteorological applications. Gardiner et al (1959) introduced third order rotatable designs for exploring response surface. Anjaneyulu et al (1994-1995) constructed third order slope rotatable designs using doubly balanced incomplete block designs. Anjaneyulu et al (2001)
introduced third order slope rotatable designs using central composite type design points. Seshu babu et al (2011) studied modified construction of third order slope rotatable designs using central composite
designs. Seshu babu et al (2014) constructed TOSRD using BIBD. In view of wide applicability of third
order models in RSM and importance of slope rotatability, we introduce A Cubic Slope Rotatable Designs Using BIBD in four dimensions.
The caustic that occur in geodesics in space-times which are solutions to the gravitational field equations with the energy-momentum tensor satisfying the dominant energy condition can be circumvented if quantum variations are allowed. An action is developed such that the variation yields the field equations
and the geodesic condition, and its quantization provides a method for determining the extent of the wave packet around the classical path.
Approximate Analytical Solution of Non-Linear Boussinesq Equation for the Uns...mathsjournal
For one dimensional homogeneous, isotropic aquifer, without accretion the governing Boussinesq equation under Dupuit assumptions is a nonlinear partial differential equation. In the present paper approximate analytical solution of nonlinear Boussinesq equation is obtained using Homotopy perturbation transform method(HPTM). The solution is compared with the exact solution. The comparison shows that the HPTM is efficient, accurate and reliable. The analysis of two important aquifer
parameters namely viz. specific yield and hydraulic conductivity is studied to see the effects on the height of water table. The results resemble well with the physical phenomena.
Common Fixed Point Theorems in Compatible Mappings of Type (P*) of Generalize...mathsjournal
In this paper, we give some new definition of Compatible mappings of type (P), type (P-1) and type (P-2) in intuitionistic generalized fuzzy metric spaces and prove Common fixed point theorems for six mappings
under the conditions of compatible mappings of type (P-1) and type (P-2) in complete intuitionistic fuzzy
metric spaces. Our results intuitionistically fuzzify the result of Muthuraj and Pandiselvi [15]
Mathematics subject classifications: 45H10, 54H25
A Probabilistic Algorithm for Computation of Polynomial Greatest Common with ...mathsjournal
- The document presents a probabilistic algorithm for computing the polynomial greatest common divisor (PGCD) with smaller factors.
- It summarizes previous work on the subresultant algorithm for computing PGCD and discusses its limitations, such as not always correctly determining the variant τ.
- The new algorithm aims to determine τ correctly in most cases when given two polynomials f(x) and g(x). It does so by adding a few steps instead of directly computing the polynomial t(x) in the relation s(x)f(x) + t(x)g(x) = r(x).
Table of Contents - September 2022, Volume 9, Number 2/3mathsjournal
Applied Mathematics and Sciences: An International Journal (MathSJ ) aims to publish original research papers and survey articles on all areas of pure mathematics, theoretical applied mathematics, mathematical physics, theoretical mechanics, probability and mathematical statistics, and theoretical biology. All articles are fully refereed and are judged by their contribution to advancing the state of the science of mathematics.
Current Ms word generated power point presentation covers major details about the micronuclei test. It's significance and assays to conduct it. It is used to detect the micronuclei formation inside the cells of nearly every multicellular organism. It's formation takes place during chromosomal sepration at metaphase.
The cost of acquiring information by natural selectionCarl Bergstrom
This is a short talk that I gave at the Banff International Research Station workshop on Modeling and Theory in Population Biology. The idea is to try to understand how the burden of natural selection relates to the amount of information that selection puts into the genome.
It's based on the first part of this research paper:
The cost of information acquisition by natural selection
Ryan Seamus McGee, Olivia Kosterlitz, Artem Kaznatcheev, Benjamin Kerr, Carl T. Bergstrom
bioRxiv 2022.07.02.498577; doi: https://doi.org/10.1101/2022.07.02.498577
ESPP presentation to EU Waste Water Network, 4th June 2024 “EU policies driving nutrient removal and recycling
and the revised UWWTD (Urban Waste Water Treatment Directive)”
Phenomics assisted breeding in crop improvementIshaGoswami9
As the population is increasing and will reach about 9 billion upto 2050. Also due to climate change, it is difficult to meet the food requirement of such a large population. Facing the challenges presented by resource shortages, climate
change, and increasing global population, crop yield and quality need to be improved in a sustainable way over the coming decades. Genetic improvement by breeding is the best way to increase crop productivity. With the rapid progression of functional
genomics, an increasing number of crop genomes have been sequenced and dozens of genes influencing key agronomic traits have been identified. However, current genome sequence information has not been adequately exploited for understanding
the complex characteristics of multiple gene, owing to a lack of crop phenotypic data. Efficient, automatic, and accurate technologies and platforms that can capture phenotypic data that can
be linked to genomics information for crop improvement at all growth stages have become as important as genotyping. Thus,
high-throughput phenotyping has become the major bottleneck restricting crop breeding. Plant phenomics has been defined as the high-throughput, accurate acquisition and analysis of multi-dimensional phenotypes
during crop growing stages at the organism level, including the cell, tissue, organ, individual plant, plot, and field levels. With the rapid development of novel sensors, imaging technology,
and analysis methods, numerous infrastructure platforms have been developed for phenotyping.
Or: Beyond linear.
Abstract: Equivariant neural networks are neural networks that incorporate symmetries. The nonlinear activation functions in these networks result in interesting nonlinear equivariant maps between simple representations, and motivate the key player of this talk: piecewise linear representation theory.
Disclaimer: No one is perfect, so please mind that there might be mistakes and typos.
dtubbenhauer@gmail.com
Corrected slides: dtubbenhauer.com/talks.html
When I was asked to give a companion lecture in support of ‘The Philosophy of Science’ (https://shorturl.at/4pUXz) I decided not to walk through the detail of the many methodologies in order of use. Instead, I chose to employ a long standing, and ongoing, scientific development as an exemplar. And so, I chose the ever evolving story of Thermodynamics as a scientific investigation at its best.
Conducted over a period of >200 years, Thermodynamics R&D, and application, benefitted from the highest levels of professionalism, collaboration, and technical thoroughness. New layers of application, methodology, and practice were made possible by the progressive advance of technology. In turn, this has seen measurement and modelling accuracy continually improved at a micro and macro level.
Perhaps most importantly, Thermodynamics rapidly became a primary tool in the advance of applied science/engineering/technology, spanning micro-tech, to aerospace and cosmology. I can think of no better a story to illustrate the breadth of scientific methodologies and applications at their best.
EWOCS-I: The catalog of X-ray sources in Westerlund 1 from the Extended Weste...Sérgio Sacani
Context. With a mass exceeding several 104 M⊙ and a rich and dense population of massive stars, supermassive young star clusters
represent the most massive star-forming environment that is dominated by the feedback from massive stars and gravitational interactions
among stars.
Aims. In this paper we present the Extended Westerlund 1 and 2 Open Clusters Survey (EWOCS) project, which aims to investigate
the influence of the starburst environment on the formation of stars and planets, and on the evolution of both low and high mass stars.
The primary targets of this project are Westerlund 1 and 2, the closest supermassive star clusters to the Sun.
Methods. The project is based primarily on recent observations conducted with the Chandra and JWST observatories. Specifically,
the Chandra survey of Westerlund 1 consists of 36 new ACIS-I observations, nearly co-pointed, for a total exposure time of 1 Msec.
Additionally, we included 8 archival Chandra/ACIS-S observations. This paper presents the resulting catalog of X-ray sources within
and around Westerlund 1. Sources were detected by combining various existing methods, and photon extraction and source validation
were carried out using the ACIS-Extract software.
Results. The EWOCS X-ray catalog comprises 5963 validated sources out of the 9420 initially provided to ACIS-Extract, reaching a
photon flux threshold of approximately 2 × 10−8 photons cm−2
s
−1
. The X-ray sources exhibit a highly concentrated spatial distribution,
with 1075 sources located within the central 1 arcmin. We have successfully detected X-ray emissions from 126 out of the 166 known
massive stars of the cluster, and we have collected over 71 000 photons from the magnetar CXO J164710.20-455217.
The binding of cosmological structures by massless topological defectsSérgio Sacani
Assuming spherical symmetry and weak field, it is shown that if one solves the Poisson equation or the Einstein field
equations sourced by a topological defect, i.e. a singularity of a very specific form, the result is a localized gravitational
field capable of driving flat rotation (i.e. Keplerian circular orbits at a constant speed for all radii) of test masses on a thin
spherical shell without any underlying mass. Moreover, a large-scale structure which exploits this solution by assembling
concentrically a number of such topological defects can establish a flat stellar or galactic rotation curve, and can also deflect
light in the same manner as an equipotential (isothermal) sphere. Thus, the need for dark matter or modified gravity theory is
mitigated, at least in part.
ESR spectroscopy in liquid food and beverages.pptxPRIYANKA PATEL
With increasing population, people need to rely on packaged food stuffs. Packaging of food materials requires the preservation of food. There are various methods for the treatment of food to preserve them and irradiation treatment of food is one of them. It is the most common and the most harmless method for the food preservation as it does not alter the necessary micronutrients of food materials. Although irradiated food doesn’t cause any harm to the human health but still the quality assessment of food is required to provide consumers with necessary information about the food. ESR spectroscopy is the most sophisticated way to investigate the quality of the food and the free radicals induced during the processing of the food. ESR spin trapping technique is useful for the detection of highly unstable radicals in the food. The antioxidant capability of liquid food and beverages in mainly performed by spin trapping technique.
Code of the multidimensional fractional pseudo-Newton method using recursive programming
1. Code of the multidimensional fractional
pseudo-Newton method using recursive
programming
A. Torres-Hernandez *,a
aDepartment of Physics, Faculty of Science - UNAM, Mexico
Abstract
The following paper presents one way to define and classify the fractional pseudo-Newton method through
a group of fractional matrix operators, as well as a code written in recursive programming to implement this
method, which through minor modifications, can be implemented in any fractional fixed-point method that allows
solving nonlinear algebraic equation systems.
Keywords: Fractional Operators; Group Theory; Fractional Iterative Methods; Recursive Programming.
1. Fractional Pseudo-Newton Method
To begin this section, it is necessary to mention that due to the large number of fractional operators that may
exist [1–6], some sets must be defined to fully characterize the fractional pseudo-Newton method1 [7–10]. It is
worth mentioning that characterizing elements of fractional calculus through sets is the main idea behind of the
methodology known as fractional calculus of sets [11]. So, considering a scalar function h : Rm → R and the
canonical basis of Rm denoted by {êk}k≥1, it is possible to define the following fractional operator of order α using
Einstein notation
oα
x h(x) := êkoα
k h(x). (1)
Therefore, denoting by ∂n
k the partial derivative of order n applied with respect to the k-th component of the
vector x, using the previous operator it is possible to define the following set of fractional operators
On
x,α(h) :=
oα
x : ∃oα
k h(x) and lim
α→n
oα
k h(x) = ∂n
k h(x) ∀k ≥ 1
, (2)
whose complement may be defined as follows
On,c
x,α(h) :=
oα
x : ∃oα
k h(x) ∀k ≥ 1 and lim
α→n
oα
k h(x) , ∂n
k h(x) in at least one value k ≥ 1
, (3)
as a consequence, it is possible to define the following set
On,u
c,x,α(h) :=
On
x,α(h) ∪ On,c
x,α(h)
∩
n
oα
x : oα
k c , 0 ∀c ∈ R {0} and ∀k ≥ 1
o
. (4)
On the other hand, considering a constant function h : Ω ⊂ Rm → Rm, it is possible to define the following set
m On,u
c,x,α(h) :=
n
oα
x : oα
x ∈ On,u
c,x,α ([h]k) ∀k ≤ m
o
, (5)
*E-mail: anthony.torres@ciencias.unam.mx; ORCID: 0000-0001-6496-9505
1Método pseudo-Newton fraccional.
1
Applied Mathematics and Sciences: An International Journal (MathSJ) Vol.9, No.1, March 2022
DOI : 10.5121/mathsj.2022.9101
2. where [h]k : Ω ⊂ Rm → R denotes the k-th component of the function h. So, it is possible to define the following
set of fractional operators
m MO∞,u
c,x,α(h) :=
k∈Z
m Ok,u
c,x,α(h), (6)
which under the classical Hadamard product it is fulfilled that
o0
x ◦ h(x) := h(x) ∀oα
x ∈ m MO∞,u
c,x,α(h). (7)
Considering that when using the classical Hadamard product in general o
pα
x ◦ o
qα
x , o
(p+q)α
x . It is possible to
define the following modified Hadamard product [11]:
o
pα
i,x ◦ o
qα
j,x :=
o
pα
i,x ◦ o
qα
j,x, if i , j (Hadamard product of type horizontal)
o
(p+q)α
i,x , if i = j (Hadamard product of type vertical)
, (8)
and considering that for each operator oα
x it is possible to define the following fractional matrix operator
Aα(oα
x ) =
[Aα(oα
x )]jk
=
oα
k
, (9)
it is possible to obtain the following theorem:
Theorem 1. Let oα
x be a fractional operator such that oα
x ∈ m MO∞,u
c,x,α(h). So, considering the modified Hadamard product
given by (8), it is possible to define the following set of fractional matrix operator
m G(Aα (oα
x )) :=
n
A◦r
α = Aα (orα
x ) : r ∈ Z and A◦r
α =
[A◦r
α ]jk
:=
orα
k
o
, (10)
which corresponds to the Abelian group generated by the operator Aα (oα
x ).
Proof. It should be noted that due to the way the set (10) is defined, just the Hadamard product of type vertical is
applied among its elements. So, ∀A
◦p
α ,A
◦q
α ∈ m G(Aα (oα
x )) it is fulfilled that
A
◦p
α ◦ A
◦q
α =
[A
◦p
α ]jk
◦
[A
◦q
α ]jk
=
o
(p+q)α
k
=
[A
◦(p+q)
α ]jk
= A
◦(p+q)
α , (11)
with which it is possible to prove that the set (10) fulfills the following properties, which correspond to the
properties of an Abelian group:
∀A
◦p
α ,A
◦p
α ,A◦r
α ∈ m G(Aα (oα
x )) it is fulfilled that
A
◦p
α ◦ A
◦q
α
◦ A◦r
α = A
◦p
α ◦
A
◦q
α ◦ A◦r
α
∃A◦0
α ∈ m G(Aα (oα
x )) such that ∀A
◦p
α ∈ m G(Aα (oα
x )) it is fulfilled that A◦0
α ◦ A
◦p
α = A
◦p
α
∀A
◦p
α ∈ m G(Aα (oα
x )) ∃A
◦−p
α ∈ m G(Aα (oα
x )) such that A
◦p
α ◦ A
◦−p
α = A◦0
α
∀A
◦p
α ,A
◦q
α ∈ m G(Aα (oα
x )) it is fulfilled that A
◦p
α ◦ A
◦q
α = A
◦q
α ◦ A
◦p
α
. (12)
From the previous theorem, it is possible to define the following group of fractional matrix operators [11]:
m GFP N (α) :=
[
oα
x ∈m MO∞,u
c,x,α(h)
m G(Aα (oα
x )), (13)
where ∀A
◦p
i,α,A
◦q
j,α ∈ m GFP N (α), with i , j, the following property is defined
2
Applied Mathematics and Sciences: An International Journal (MathSJ) Vol.9, No.1, March 2022
3. A
◦p
i,α ◦ A
◦q
j,α = A◦1
k,α := Ak,α
o
pα
i,x ◦ o
qα
j,x
, p,q ∈ Z {0}, (14)
as a consequence, it is fulfilled that
∀A◦1
k,α ∈ m GFP N (α) such that Ak,α
oα
k,x
= Ak,α
o
pα
i,x ◦ o
qα
j,x
∃A◦r
k,α = A
◦(r−1)
k,α ◦ A◦1
k,α = Ak,α
o
rpα
i,x ◦ o
rqα
j,x
. (15)
Then, it is possible to obtain the following result:
∀A◦1
α ∈ m GFP N (α) ∃A,α := A◦1
α ◦ Im + Im, (16)
where Im denotes the identity matrix of m × m and is a positive constant 1. So, defining the following
function
β(α,[x]k) :=
(
α, if |[x]k| , 0
1, if |[x]k| = 0
, (17)
the fractional pseudo-Newton method may be defined and classified through the following set of matrices:
n
A,β = A,β
A◦1
α
: A◦1
α ∈ mGFP N (α) and A,β(x) =
[A,β]jk(x)
o
. (18)
Therefore, if ΦFP N denotes the iteration function of the fractional pseudo-Newton method, it is possible to
obtain the following result:
Let α0 ∈ R Z ⇒ ∀A◦1
α0
∈ m GFP N (α) ∃ΦFP N = ΦFP N (Aα0
) ∴ ∀Aα0
∃{ΦFP N (Aα) : α ∈ R Z}. (19)
To end this section, it is worth mentioning that the fractional pseudo-Newton method has been used in the
study for the construction of hybrid solar receivers [7, 8, 12], and that in recent years there has been a growing
interest in fractional operators and their properties for solving nonlinear algebraic equation systems [13–22].
2. Programming Code of Fractional Pseudo-Newton Method
The following code was implemented in Python 3 and requires the following packages:
1 import math as mt
2 import numpy as np
3 from numpy import linalg as la
For simplicity, a two-dimensional vector function is used to implement the code, that is, f : Ω ⊂ R2 → R2,
which may be denoted as follows:
f (x) =
[f ]1(x)
[f ]2(x)
!
, (20)
where [f ]i : Ω ⊂ R2 → R ∀i ∈ {1,2}. Then considering a function Φ : (R Z) × Cn → Cn, the fractional pseudo-
Newton method may be denoted as follows [11,23]:
xi+1 := Φ(α,xi) = xi − A,β(xi)f (xi), i = 0,1,2··· , (21)
where A,β(xi) is a matrix evaluated in the value xi, which is given by the following expression
A,β(xi) =
[A,β]jk(xi)
:=
o
β(α,[xi]k)
k δjk + δjk
xi
, (22)
3
Applied Mathematics and Sciences: An International Journal (MathSJ) Vol.9, No.1, March 2022
4. with δjk the Kronecker delta. It is worth mentioning that one of the main advantages of fractional iterative
methods is that the initial condition x0 can remain fixed, with which it is enough to vary the order α of the
fractional operators involved until generating a sequence convergent {xi}i≥1 to the value ξ ∈ Ω. Since the order α
of the fractional operators is varied, different values of α can generate different convergent sequences to the same
value ξ but with a different number of iterations. So, it is possible to define the following set
Convδ(ξ) :=
(
Φ : lim
x→ξ
Φ(α,x) = ξα ∈ B(ξ;δ)
)
, (23)
which may be interpreted as the set of fractional fixed-point methods that define a convergent sequence {xi}i≥1
to some value ξα ∈ B(ξ;δ). So, denoting by card(·) the cardinality of a set, under certain conditions it is possible to
prove the following result (see reference [11], proof of Theorem 2):
card(Convδ(ξ)) = card(R), (24)
from which it follows that the set (23) is generated by an uncountable family of fractional fixed-point methods.
Before continuing, it is necessary to define the following corollary [11]:
Corollary 1. Let Φ : (R Z) × Cn → Cn be an iteration function such that Φ ∈ Convδ(ξ). So, if Φ has an order of
convergence of order (at least) p in B(ξ;1/2), for some m ∈ N, there exists a sequence {Pi}i≥m ∈ B(p;δK) given by the
following values
Pi =
log(kxi − xi−1k)
log(kxi−1 − xi−2k)
, (25)
such that it fulfills the following condition:
lim
i→∞
Pi → p,
and therefore, there exists at least one value k ≥ m such that
Pk ∈ B(p;). (26)
The previous corollary allows estimating numerically the order of convergence of an iteration function Φ that
generates at least one convergent sequence {xi}i≥1. On the other hand, the following corollary allows characterizing
the order of convergence of an iteration function Φ through its Jacobian matrix Φ(1) [11,22]:
Corollary 2. Let Φ : (R Z) × Cn → Cn be an iteration such that Φ ∈ Convδ(ξ). So, if Φ has an order of convergence of
order (at least) p in B(ξ;δ), it is fulfilled that:
p :=
1, if lim
x→ξ
Φ(1)
(α,x)
, 0
2, if lim
x→ξ
Φ(1)
(α,x)
= 0
. (27)
Before continuing, it is necessary to mention that what is shown below is an extremely simplified way of how
a fractional iterative method should be implemented. A more detailed description, as well as some applications,
may be found in the references [11,20–23]. Considering the particular case with Φ : (RZ)×Rn → Rn, and defining
the following notation:
ErrDom :=
n
kxi − xi−1k2
o
i≥1
, ErrIm :=
n
kf (xi)k2
o
i≥1
, X :=
n
xi
o
i≥1
, (28)
it is possible to implement a particular case of the multidimensional fractional pseudo-Newton method through
recursive programming using the following functions [10]:
4
Applied Mathematics and Sciences: An International Journal (MathSJ) Vol.9, No.1, March 2022
5. 1 def Dfrac(α,x):
2 return pow(x,-α)/mt.gamma(1-α) if abs(1-α)0 else 0
3
4 def β(α,x):
5 return α if abs(x)0 else 1
6
7 def Aβ(α,x):
8 N=len(x)
9 y=np.zeros((N,N))
10 =pow(10,-4)
11 for i in range(0,N):
12 y[i][i]=Dfrac(β(α,x[i]),x[i])+
13 return y
14
15 def FractionalPseudoNewton(ErrDom,ErrIm,X,α,x0):
16 Tol=pow(10,-5)
17 Lim=pow(10,2)
18
19 x1=x0-np.matmul(Aβ(α,x0),f(x0))
20 ED=la.norm(x1-x0)
21
22 if ED0:
23 EI=la.norm(f(x1))
24
25 ErrDom.append(ED)
26 ErrIm.append(EI)
27 X.append(x1)
28 N=len(X)
29
30 if max(ED,EI)Tol and NLim:
31 ErrDom,ErrIm,X=FractionalPseudoNewton(ErrDom,ErrIm,X,α,x1)
32
33 return ErrDom,ErrIm,X
To implement the above functions, it is necessary to follow the steps shown below:
i) A function must be programmed (information of the following nonlinear function may be found in the
reference [9]).
1 def f(x):
2 y=np.zeros((2,1))
3
4 a1=0.5355
5 a2=1.5808
6 a3=1.5355
7 a4=0.5808
8 a5=18.9753
9 a6=451474
10 a7=396499
11
12 d1=pow(x[0],a3)-pow(x[1],a3)
13 d2=pow(x[0],a4)-pow(x[1],a4)
14 d3=pow(x[0],a3+a4)-pow(x[1],a3+a4)
15
16 y[0]=x[0]-(a6/a5)+(a2*x[0]*pow(x[1],a3)*d2-a1*pow(x[0],a2)*d1)/(a1*a2*d3)
17 y[1]=x[1]-(a7/a5)+(a2*pow(x[0],a3)*x[1]*d2-a1*pow(x[1],a2)*d1)/(a1*a2*d3)
18 return y
ii) Three empty vectors, a fractional order α, and an initial condition x0 must be defined before implementing
the function FractionalPseudoNewton.
1 ErrDom=[]
2 ErrIm=[]
3 X=[]
4
5 α=-0.02705
6
7 x0=np.ones((2,1))
8 x0[0]=1
9 x0[1]=2
10
11 ErrDom,ErrIm,X=FractionalPseudoNewton(ErrDom,ErrIm,X,α,x0)
5
Applied Mathematics and Sciences: An International Journal (MathSJ) Vol.9, No.1, March 2022
6. When implementing the previous steps, if the fractional order α and initial condition x0 are adequate to ap-
proach a zero of the function f , results analogous to the following are obtained:
i [xi]1 [xi]2 kxi − xi−1k2 kf (xi)k2
1 24154.6890055726 21615.770565224655 32412.27808445575 3173.9427518435878
2 23797.525207771814 17409.867461022026 4221.040973551523 2457.2339691838274
3 27022.686583015326 16837.96263298479 3275.4756950243 1936.4252930355906
4 28968.497786158376 15149.13086241385 2576.4964559585133 1988.3049656277824
5 31513.395908759314 14371.120308833728 2661.1664502431686 1670.221737448303
6 33594.7029990163 13550.005464416314 2237.4245890480047 1489.2609462571957
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
61 41844.57086184946 11857.321286205206 6.11497121228039e − 05 2.0557739187213006e − 05
62 41844.5708629114 11857.321259325998 2.690017756661858e − 05 2.567920334469916e − 05
63 41844.57089334319 11857.321275572 3.449675719137571e − 05 1.2220011320189923e − 05
64 41844.57089188268 11857.32125964514 1.5993685206416137e − 05 1.4647204650186194e − 05
65 41844.57090877583 11857.3212696822 1.964996494386499e − 05 7.37448238916247e − 06
66 41844.57090683372 11857.32126021737 9.662028743039773e − 06 8.428415184912125e − 06
Table 1: Results obtained using the fractional pseudo-Newton method [10].
Therefore, from the Corollary 1, the following result is obtained:
P66 =
log(kx66 − x65k)
log(kx65 − x64k)
≈ 1.0655 ∈ B(p;δK),
which is consistent with the Corollary 2, since if ΦFP N ∈ Convδ(ξ), in general ΦFP N fulfills the following
condition (see reference [22], proof of Proposition 1):
lim
x→ξ
Φ
(1)
FP N (α,x)
, 0, (29)
from which it is concluded that the fractional pseudo-Newton method has an order of convergence (at least)
linear in B(ξ;δ).
References
[1] José A Tenreiro Machado et al. A review of definitions for fractional derivatives and integral. Mathematical
Problems in Engineering, pages 1–6, 2014.
[2] G Sales Teodoro, JA Tenreiro Machado, and E Capelas De Oliveira. A review of definitions of fractional
derivatives and other operators. Journal of Computational Physics, 388:195–208, 2019.
[3] Mehmet Yavuz and Necati Özdemir. Comparing the new fractional derivative operators involving exponen-
tial and mittag-leffler kernel. Discrete Continuous Dynamical Systems-S, 13(3):995, 2020.
[4] M Abu-Shady and Mohammed KA Kaabar. A generalized definition of the fractional derivative with appli-
cations. Mathematical Problems in Engineering, 2021.
[5] Khaled M Saad. New fractional derivative with non-singular kernel for deriving legendre spectral collocation
method. Alexandria Engineering Journal, 59(4):1909–1917, 2020.
[6] Jian-Gen Liu, Xiao-Jun Yang, Yi-Ying Feng, and Ping Cui. New fractional derivative with sigmoid function
as the kernel and its models. Chinese Journal of Physics, 68:533–541, 2020.
[7] A. Torres-Hernandez, F. Brambila-Paz, P. M. Rodrigo, and E. De-la-Vega. Fractional pseudo-newton method
and its use in the solution of a nonlinear system that allows the construction of a hybrid solar receiver. Applied
Mathematics and Sciences: An International Journal (MathSJ), 7:1–12, 2020. DOI: 10.5121/mathsj.2020.7201.
[8] A. Torres-Hernandez, F. Brambila-Paz, P. M. Rodrigo, and E. De-la-Vega. Reduction of a nonlinear system
and its numerical solution using a fractional iterative method. Journal of Mathematics and Statistical Science,
6:285–299, 2020. ISSN 2411-2518.
6
Applied Mathematics and Sciences: An International Journal (MathSJ) Vol.9, No.1, March 2022
7. [9] A. Torres-Hernandez, F. Brambila-Paz, and J. J. Brambila. A nonlinear system related to investment under
uncertainty solved using the fractional pseudo-newton method. Journal of Mathematical Sciences: Advances
and Applications, 63:41–53, 2020. DOI: 10.18642/jmsaa 7100122150.
[10] A. Torres-Henandez and F. Brambila-Paz. An approximation to zeros of the riemann zeta function using
fractional calculus. Mathematics and Statistics, 9(3):309–318, 2021. DOI: 10.13189/ms.2021.090312.
[11] A. Torres-Hernandez and F. Brambila-Paz. Sets of fractional operators and numerical estimation of the order
of convergence of a family of fractional fixed-point methods. Fractal and Fractional, 5(4):240, 2021. DOI:
10.3390/fractalfract5040240.
[12] Eduardo De-la Vega, Anthony Torres-Hernandez, Pedro M Rodrigo, and Fernando Brambila-Paz. Fractional
derivative-based performance analysis of hybrid thermoelectric generator-concentrator photovoltaic system.
Applied Thermal Engineering, 193:116984, 2021. DOI: 10.1016/j.applthermaleng.2021.116984.
[13] R Erfanifar, K Sayevand, and H Esmaeili. On modified two-step iterative method in the fractional sense:
some applications in real world phenomena. International Journal of Computer Mathematics, 97(10):2109–
2141, 2020.
[14] Alicia Cordero, Ivan Girona, and Juan R Torregrosa. A variant of chebyshev’s method with 3αth-order of
convergence by using fractional derivatives. Symmetry, 11(8):1017, 2019.
[15] Krzysztof Gdawiec, Wiesław Kotarski, and Agnieszka Lisowska. Newton’s method with fractional derivatives
and various iteration processes via visual analysis. Numerical Algorithms, 86(3):953–1010, 2021.
[16] Krzysztof Gdawiec, Wiesław Kotarski, and Agnieszka Lisowska. Visual analysis of the newton’s method with
fractional order derivatives. Symmetry, 11(9):1143, 2019.
[17] Ali Akgül, Alicia Cordero, and Juan R Torregrosa. A fractional newton method with 2αth-order of conver-
gence and its stability. Applied Mathematics Letters, 98:344–351, 2019.
[18] Giro Candelario, Alicia Cordero, and Juan R Torregrosa. Multipoint fractional iterative methods with (2α+
1) th-order of convergence for solving nonlinear problems. Mathematics, 8(3):452, 2020.
[19] Giro Candelario, Alicia Cordero, Juan R Torregrosa, and Marı́a P Vassileva. An optimal and low compu-
tational cost fractional newton-type method for solving nonlinear equations. Applied Mathematics Letters,
124:107650, 2022.
[20] A. Torres-Hernandez and F. Brambila-Paz. Fractional newton-raphson method. Applied Mathematics and
Sciences: An International Journal (MathSJ), 8:1–13, 2021. DOI: 10.5121/mathsj.2021.8101.
[21] A. Torres-Hernandez, F. Brambila-Paz, and E. De-la-Vega. Fractional newton-raphson method and some
variants for the solution of nonlinear systems. Applied Mathematics and Sciences: An International Journal
(MathSJ), 7:13–27, 2020. DOI: 10.5121/mathsj.2020.7102.
[22] A. Torres-Hernandez, F. Brambila-Paz, U. Iturrarán-Viveros, and R. Caballero-Cruz. Fractional newton-
raphson method accelerated with aitken’s method. Axioms, 10(2):1–25, 2021. DOI: 10.3390/ax-
ioms10020047.
[23] A. Torres-Hernandez, F. Brambila-Paz, and R. Montufar-Chaveznava. Acceleration of the order of conver-
gence of a family of fractional fixed point methods and its implementation in the solution of a nonlinear
algebraic system related to hybrid solar receivers. 2021. arXiv preprint arXiv:2109.03152.
7
Applied Mathematics and Sciences: An International Journal (MathSJ) Vol.9, No.1, March 2022