11 results
Search Results
2. Formal reduction of singular linear differential systems using eigenrings: A refined approach.
- Author
-
Barkatou, Moulay A., Saade, Joelle, and Weil, Jacques-Arthur
- Subjects
- *
LINEAR systems , *LAURENT series , *ALGORITHMS , *POWER series , *MAPLE - Abstract
This paper provides a new algorithm for the formal reduction of linear differential systems with Laurent series coefficients. We show how to obtain a decomposition of Balser, Jurkat and Lutz using eigenring techniques. This allows us to establish structural information on the obtained indecomposable subsystems and retrieve information on their invariants such as ramification. We show why classical algorithms then perform well on these subsystems. We also give precise estimates of the precision on the power series which is required in each step of our algorithm. The algorithm is implemented in Maple and examples are given in Saade (2018). [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
3. A symbolic algorithm to compute immersions of polynomial systems into linear ones up to an output injection.
- Author
-
Menini, Laura, Possieri, Corrado, and Tornambè, Antonio
- Subjects
- *
ALGEBRAIC geometry , *POLYNOMIALS , *ALGORITHMS , *COEFFICIENTS (Statistics) , *LINEAR systems - Abstract
In this paper, a symbolic, algorithmic procedure to compute an immersion that recasts a polynomial system into a linear one up to an output injection is proposed. Such a technique is based on computing, through algebraic geometry methods, the set of all the embeddings of the system and on matching the coefficients of these polynomials with the ones of the embeddings of a linear system up to an output injection. The given algorithm is then relaxed to compute an immersion that recasts a polynomial system into a form that is linear up to a finite order and an output injection and to compute an approximation of the immersion. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
4. Iterative algorithms for the input and state recovery from the approximate inverse of strictly proper multivariable systems.
- Author
-
Chen, Liwen and Xu, Qiang
- Subjects
- *
ALGORITHMS , *LINEAR time invariant systems , *LINEAR systems , *DISCRETE-time systems , *BOEING 767 (Jet transport) - Abstract
This paper proposes new iterative algorithms for the unknown input and state recovery from the system outputs using an approximate inverse of the strictly proper linear time-invariant (LTI) multivariable system. One of the unique advantages from previous system inverse algorithms is that the output differentiation is not required. The approximate system inverse is stable due to the systematic optimal design of a dummy feedthrough D matrix in the state-space model via the feedback stabilization. The optimal design procedure avoids trial and error to identify such a D matrix which saves tremendous amount of efforts. From the derived and proved convergence criteria, such an optimal D matrix also guarantees the convergence of algorithms. Illustrative examples show significant improvement of the reference input signal tracking by the algorithms and optimal D design over non-iterative counterparts on controllable or stabilizable LTI systems, respectively. Case studies of two Boeing-767 aircraft aerodynamic models further demonstrate the capability of the proposed methods. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
5. Implicitizing rational surfaces using moving quadrics constructed from moving planes.
- Author
-
Lai, Yisheng and Chen, Falai
- Subjects
- *
TENSOR products , *QUADRICS , *LINEAR systems , *ALGORITHMS , *MATHEMATICS - Abstract
This paper presents a new algorithm for implicitizing tensor product surfaces of bi-degree ( m , n ) with no base points, assuming that there are no moving planes of bi-degree ( m − 1 , n − 1 ) following the surface. The algorithm is based on some structural results: (1) There are exactly 2 n linearly independent moving planes of bi-degree ( m , n − 1 ) following the surface; (2) mn linearly independent moving quadrics of bi-degree ( m − 1 , n − 1 ) following the surface can be constructed from the 2 n linearly independent moving planes; (3) The mn linearly independent moving quadrics form a compact determinant of order mn which exactly gives the implicit equation of the rational surface. Complexity analysis and experimental results show that the new algorithm is significantly more efficient than the previous methods. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
6. Factoring linear partial differential operators in n variables.
- Author
-
Giesbrecht, Mark, Heinle, Albert, and Levandovskyy, Viktor
- Subjects
- *
FACTORIZATION , *PARTIAL differential operators , *LINEAR systems , *MATHEMATICAL variables , *ALGORITHMS , *POLYNOMIALS , *NONCOMMUTATIVE algebras , *COMMUTATIVE rings - Abstract
In this paper, we present a new algorithm and an experimental implementation for factoring elements in the polynomial n th Weyl algebra, the polynomial n th shift algebra, and Z n -graded polynomials in the n th q _ -Weyl algebra. The most unexpected result is that this noncommutative problem of factoring partial differential operators can be approached effectively by reducing it to the problem of solving systems of polynomial equations over a commutative ring. In the case where a given polynomial is Z n -graded, we can reduce the problem completely to factoring an element in a commutative multivariate polynomial ring. The implementation in Singular is effective on a broad range of polynomials and increases the ability of computer algebra systems to address this important problem. We compare the performance and output of our algorithm with other implementations in major computer algebra systems on nontrivial examples. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
7. Does modeling lead to more accurate classification?: A study of relative efficiency in linear classification.
- Author
-
Lee, Yoonkyung and Wang, Rui
- Subjects
- *
LINEAR systems , *MATHEMATICAL statistics , *DATA analysis , *ALGORITHMS , *LOGISTIC regression analysis , *SUPPORT vector machines - Abstract
Classification arises in a wide range of applications. A variety of statistical tools have been developed for learning classification rules from data. Understanding of their relative merits and comparisons help users to choose a proper method in practice. This paper focuses on theoretical comparison of model-based classification methods in statistics with algorithmic methods in machine learning in terms of the error rate. Extending Efron’s comparison of logistic regression with linear discriminant analysis (LDA) under the normal setting, we contrast such algorithmic methods as the support vector machine (SVM) and boosting with the LDA and logistic regression and study their relative efficiencies in reducing the error rate based on the limiting behavior of the classification boundary of each method. We show that algorithmic methods are generally less effective than model-based methods in the normal setting. In particular, loss of efficiency in error rate is typically about 33% to 60% for the SVM and 50% to 80% for boosting when compared to the LDA. However, a smooth variant of the SVM is shown to be even more efficient than logistic regression. In addition to the theoretical study, we present results from numerical experiments under various settings for comparisons of finite-sample performance and robustness to mislabeling and model misspecification. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
8. Recovering external forces on vibrating Euler–Bernoulli beams using boundary shape function methods.
- Author
-
Liu, Chein-Shan, Kuo, Chung-Lun, and Chang, Chih-Wen
- Subjects
- *
ALGORITHMS , *LINEAR systems , *BESSEL beams - Abstract
• The proposed simple algorithm is very different from conventional numerical methods. • A family of boundary shape functions in this algorithm plays the most important role of the accuracy. • Accurate and stable results are acquired for large noises. In this paper, we recover unknown space–time dependent forces imposed on the vibrating Euler–Bernoulli beams under different boundary conditions, including simply supported, clamped-hinged, cantilevered, and two-end fixed conditions. The data overspecified to recover the external force are the final time displacement and the right-side strain or right-side moment of the beam. We develop a family of boundary shape functions, which automatically satisfy the initial conditions, final time condition, and homogeneous boundary conditions for each type of beam. When the solution is obtained using the method of superimposing boundary shape functions and solving a small-scale linear system to satisfy an extra right-side boundary condition, the unknown force can be recovered through back-substitution of the solution into the Euler–Bernoulli beam equation. The accuracy and robustness of the proposed methods are confirmed by comparing the recovered results of seven examples to the exact forces, even though considerable noise is present in the overspecified data. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
9. Marginal multi-object Bayesian filter with multiple hypotheses.
- Author
-
Liu, Zong-xiang, Chen, Wei, Chen, Qi-yue, and Li, Liang-qun
- Subjects
- *
KALMAN filtering , *PROBABILITY density function , *ASSIGNMENT problems (Programming) , *HYPOTHESIS , *ALGORITHMS , *MATHEMATICAL models , *LINEAR systems - Abstract
This paper proposes a marginal multi-object Bayesian filter with multiple hypotheses to track multiple objects in the presence of object appearing and object disappearing, missed detection and clutter. This filter delivers the probability of existence and probability density function of each object. A mathematical model for searching K-best hypotheses is set up by the maximization of the generalized joint likelihood ratios of hypotheses, which results in a 2-dimensional assignment problem. The K-best hypotheses can be acquired by using the Murty algorithm to solve the 2-dimensional assignment problem. According to the K-best hypotheses, the existence probabilities and probability density functions of objects are formed. Furthermore, an implementation of this filter for a linear Gaussian system is developed and is extended to nonlinear observations. Experimental result demonstrates that the proposed filter outperforms other available filters at various numbers of clutter and different detecting probabilities. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
10. A novel second-order linear scheme for the Cahn-Hilliard-Navier-Stokes equations.
- Author
-
Chen, Lizhen and Zhao, Jia
- Subjects
- *
NAVIER-Stokes equations , *EQUATIONS , *VECTOR spaces , *ENERGY dissipation , *ALGORITHMS , *LINEAR systems - Abstract
• We propose a novel numerical algorithm for solving the Cahn-Hilliard-Navier-Stokes (CHNS) equations. • The scheme is second-order and linear while preserving the energy dissipation law. • The proposed scheme only requires solving linear systems, and the solution existence and uniqueness are guaranteed. • The proposed scheme obeys an energy dissipation law in the original variables. In this paper, we consider the Cahn-Hilliard equation coupled with the incompressible Navier-Stokes equation, usually known as the Cahn-Hilliard-Navier-Stokes (CHNS) system. The CHNS system has been widely embraced to investigate the dynamics of a binary fluid mixture. By utilizing the modified leap-frog time-marching method, we propose a novel numerical algorithm for solving the CHNS system in an efficient and accurate manner. This newly proposed scheme has several advantages. First of all, the proposed scheme is linear in time and space, such that only a linear algebraic system needs to be solved at each time-marching step, making it extremely efficient. Also, the existence and uniqueness of numerical solutions are guaranteed for any time step size. In addition, the scheme is unconditionally energy stable with second-order accuracy in time and spectral accuracy in space, such that relatively large temporal and spatial mesh sizes can be used to obtain reliable numerical solutions. The rigorous proofs for the unconditional energy stable property and solution existence and uniqueness are given. Furthermore, we present several numerical examples to test the proposed numerical algorithm and illustrate its accuracy and efficiency. The differences of coarsening dynamics between the Cahn-Hilliard equation and the Cahn-Hilliard-Navier-Stokes equations have been investigated as well. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
11. Distortion-less PAPR reduction algorithm for multi-user MIMO system with linear precoding.
- Author
-
Fang, Zhou, Qian, Hua, Kang, Kai, Wang, Haifeng, and Jin, Yanliang
- Subjects
- *
LINEAR systems , *CODING theory , *TELECOMMUNICATION systems , *MIMO systems , *ALGORITHMS , *WIRELESS power transmission - Abstract
High peak-to-average power ratio (PAPR) is a major factor degrading power efficiency of communication systems. In multi-user (MU) multiple-input multiple-output (MIMO) systems, the PAPR becomes even worse since the power efficiency of the system is determined by the transmission stream with the highest PAPR. In this paper, we propose two PAPR reduction algorithms based on linear precoding, which exploit extra degree-of-freedom of the channel state matrix in MU-MIMO systems. The basic idea is to generate candidate output signals by multiplying the input signal with a set of equivalent linear precoding matrices, and find the signal with the lowest PAPR for transmission. The proposed algorithms are distortion-less PAPR reduction algorithms that do not sacrifice the system performance. Comparing to other distortion-less PAPR reduction algorithms, the proposed algorithms do not need to transmit side information, thus comply with existing MU-MIMO systems. Numerical results further validate our designs. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.