Certifying isolated singular points and their multiplicity structure

This paper presents two new constructions related to singular solutions of polynomial systems. The first is a new deflation method for an isolated singular root. This construc-tion uses a single linear differential form defined from the Jacobian matrix of the input, and defines the deflated system by applying this differential form to the original system. The advantages of this new deflation is that it does not introduce new variables and the increase in the number of equations is linear instead of the quadratic increase of previous methods. The second construction gives the coefficients of the so-called inverse system or dual basis, which defines the multiplicity structure at the singular root. We present a system of equations in the original variables plus a relatively small number of new vari-ables. We show that the roots of this new system include the original singular root but now with multiplicity one, and the new variables uniquely determine the multiplicity structure. Both constructions are "exact", meaning that they permit one to treat all conjugate roots simultaneously and can be used in certification procedures for singular roots and their multiplicity structure with respect to an exact rational polynomial system

On deflation and multiplicity structure

This paper presents two new constructions related to singular solutions of polynomial systems. The first is a new deflation method for an isolated singular root. This construction uses a single linear differential form defined from the Jacobian matrix of the input, and defines the deflated system by applying this differential form to the original system. The advantages of this new deflation is that it does not introduce new variables and the increase in the number of equations is linear in each iteration instead of the quadratic increase of previous methods. The second construction gives the coefficients of the so-called inverse system or dual basis, which defines the multiplicity structure at the singular root. We present a system of equations in the original variables plus a relatively small number of new variables that completely deflates the root in one step. We show that the isolated simple solutions of this new system correspond to roots of the original system with given multiplicity structure up to a given order. Both constructions are "exact" in that they permit one to treat all conjugate roots simultaneously and can be used in certification procedures for singular roots and their multiplicity structure with respect to an exact rational polynomial system.Comment: arXiv admin note: substantial text overlap with arXiv:1501.0508

Wavelets operational methods for fractional differential equations and systems of fractional differential equations

In this thesis, new and effective operational methods based on polynomials and wavelets for the solutions of FDEs and systems of FDEs are developed. In particular we study one of the important polynomial that belongs to the Appell family of polynomials, namely, Genocchi polynomial. This polynomial has certain great advantages based on which an effective and simple operational matrix of derivative was first derived and applied together with collocation method to solve some singular second order differential equations of Emden-Fowler type, a class of generalized Pantograph equations and Delay differential systems. A new operational matrix of fractional order derivative and integration based on this polynomial was also developed and used together with collocation method to solve FDEs, systems of FDEs and fractional order delay differential equations. Error bound for some of the considered problems is also shown and proved. Further, a wavelet bases based on Genocchi polynomials is also constructed, its operational matrix of fractional order derivative is derived and used for the solutions of FDEs and systems of FDEs. A novel approach for obtaining operational matrices of fractional derivative based on Legendre and Chebyshev wavelets is developed, where, the wavelets are first transformed into corresponding shifted polynomials and the transformation matrices are formed and used together with the polynomials operational matrices of fractional derivatives to obtain the wavelets operational matrix. These new operational matrices are used together with spectral Tau and collocation methods to solve FDEs and systems of FDEs

A block Krylov subspace time-exact solution method for linear ODE systems

We propose a time-exact Krylov-subspace-based method for solving linear ODE (ordinary differential equation) systems of the form $y'=-Ay + g(t)$ and $y''=-Ay + g(t)$, where $y(t)$ is the unknown function. The method consists of two stages. The first stage is an accurate piecewise polynomial approximation of the source term $g(t)$, constructed with the help of the truncated SVD (singular value decomposition). The second stage is a special residual-based block Krylov subspace method. The accuracy of the method is only restricted by the accuracy of the piecewise polynomial approximation and by the error of the block Krylov process. Since both errors can, in principle, be made arbitrarily small, this yields, at some costs, a time-exact method. Numerical experiments are presented to demonstrate efficiency of the new method, as compared to an exponential time integrator with Krylov subspace matrix function evaluations

Nilpotent center conditions in cubic switching polynomial Li\'enard systems by higher-order analysis

The aim of this paper is to investigate two classical problems related to nilpotent center conditions and bifurcation of limit cycles in switching polynomial systems. Due to the difficulty in calculating the Lyapunov constants of switching polynomial systems at non-elementary singular points, it is extremely difficult to use the existing Poincar\'e-Lyapunov method to study these two problems. In this paper, we develop a higher-order Poincar\'e-Lyapunov method to consider the nilpotent center problem in switching polynomial systems, with particular attention focused on cubic switching Li\'enard systems. With proper perturbations, explicit center conditions are derived for switching Li\'enard systems at a nilpotent center, which is characterized as global. Moreover, with Bogdanov-Takens bifurcation theory, the existence of five limit cycles around the nilpotent center is proved for a class of switching Li\'enard systems, which is a new lower bound of cyclicity for such polynomial systems around a nilpotent center

A direct method to obtain a realization of a polynomial matrix and its applications

[EN] In this paper we present a Silverman-Ho algorithm-based method to obtain a realization of a polynomial matrix. This method provides the final formulation of a minimal realization directly from a full rank factorization of a specific given matrix. Also, some classical problems in control theory such as model reduction in singular systems or the positive realization problem in standard systems are solved with this method.Work supported by the Spanish DGI grant MTM2017-85669-P-AR.Cantó Colomina, R.; Moll López, SE.; Ricarte Benedito, B.; Urbano Salvador, AM. (2020). A direct method to obtain a realization of a polynomial matrix and its applications. Revista de la Real Academia de Ciencias Exactas Físicas y Naturales Serie A Matemáticas. 114(2):1-15. https://doi.org/10.1007/s13398-020-00819-1S1151142Anderson, B.D.O., Bongpanitlerd, S.: Network Analysis and Synthesis, A Modern Systems Theory Approach. Prentice-Hall Inc., New Jersey (1968)Benvenuti, L., Farina, L.: A tutorial on the positive realization problem. IEEE Trans. Autom. Control 49(5), 651–664 (2004). https://doi.org/10.1109/TAC.2004.826715Bru, R., Coll, C., Sánchez, E.: Structural properties of positive linear time-invariant difference-algebraic equations. Linear Algebra Appl. 349, 1–10 (2002). https://doi.org/10.1016/S0024-3795(02)00277-XCantó, R., Ricarte, B., Urbano, A.M.: Positive realizations of transfer matrices with real poles. IEEE Trans. Circuits Syst. II Expr. Br. 54(6), 517–521 (2007). https://doi.org/10.1109/TCSII.2007.894408Cantó, R., Ricarte, B., Urbano, A.M.: On positivity of discrete-time singular systems and the realization problem. Lect. Notes Control Inf. Sci. 389, 251–258 (2009). https://doi.org/10.1007/978-3-642-02894-6_24Climent, J., Napp, D., Requena, V.: Block Toeplitz matrices for burst-correcting convolutional codes. RACSAM 114, 38 (2020). https://doi.org/10.1007/s13398-019-00744-yDai, L.: Singular Control Systems. Lecture Notes in Control and Information Sciences. Springer-Verlag, New York (1989)Golub, G.H., Van Loan, C.F.: Matrix Computations, Fourth edn. Johns Hopkins University Press, Baltimore (2013)Henrion, D., Šebek, M.: Polynomial and matrix fraction description. In: Control Systems, Robotics and Automation, vol. 7, pp. 211-231, (2009). http://www.eolss.net/Sample-Chapters/C18/E6-43-13-05.pdfHo, B.L., Kalman, R.E.: Effective construction of linear state-variable models from mput/output functions. Regelungstechnik 14(12), 545–548 (1966)Kaczorek, T.: Weakly positive continuous-time linear systems. Lect. Notes Control Inf. Sci. 243, 3–16 (1999)Kaczorek, T.: Positive 1D and 2D Systems, vol. 431. Springer, London (2002)Kaczorek, T.: Externally and internally positive singular discrete-time linear systems. Int. J. Appl. Math. Comput. Sci. 12(2), 197–202 (2002)MATLAB, The Math Works, Inc., Natick, Massachusetts, United States. Official website: http://www.mathworks.comMcCrory, C., Parusinski, A.: The weight filtration for real algebraic varieties II: classical homology. RACSAM 108, 63–94 (2014). https://doi.org/10.1007/s13398-012-0098-ySilverman, L.: Realization of linear dynamical systems. IEEE Trans. Autom. Control 16(6), 554–567 (1971)Virnik, E.: Stability analysis of positive descriptor systems. Linear Algebra Appl. 429(10), 2640–2659 (2008