Bibliographies thématiques / Minimal nonnegative solution

Littérature scientifique sur le sujet « Minimal nonnegative solution »

Auteur : Grafiati
Publié le 10 mars 2023

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Sommaire

Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Minimal nonnegative solution ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Articles de revues sur le sujet "Minimal nonnegative solution"

1

Guo, Pei-Chang. « Newton-Shamanskii Method for a Quadratic Matrix Equation Arising in Quasi-Birth-Death Problems ». East Asian Journal on Applied Mathematics 4, no 4 (novembre 2014) : 386–95. http://dx.doi.org/10.4208/eajam.040914.301014a.

Texte intégral
Résumé :
AbstractIn order to determine the stationary distribution for discrete time quasi-birth-death Markov chains, it is necessary to find the minimal nonnegative solution of a quadratic matrix equation. The Newton-Shamanskii method is applied to solve this equation, and the sequence of matrices produced is monotonically increasing and converges to its minimal nonnegative solution. Numerical results illustrate the effectiveness of this procedure.
Styles APA, Harvard, Vancouver, ISO, etc.
2

Guo, Pei-Chang. « A Fast Newton-Shamanskii Iteration for a Matrix Equation Arising from M/G/1-Type Markov Chains ». Mathematical Problems in Engineering 2017 (2017) : 1–8. http://dx.doi.org/10.1155/2017/4018239.

Texte intégral
Résumé :
For the nonlinear matrix equations arising in the analysis of M/G/1-type and GI/M/1-type Markov chains, the minimal nonnegative solution G or R can be found by Newton-like methods. We prove monotone convergence results for the Newton-Shamanskii iteration for this class of equations. Starting with zero initial guess or some other suitable initial guess, the Newton-Shamanskii iteration provides a monotonically increasing sequence of nonnegative matrices converging to the minimal nonnegative solution. A Schur decomposition method is used to accelerate the Newton-Shamanskii iteration. Numerical examples illustrate the effectiveness of the Newton-Shamanskii iteration.
Styles APA, Harvard, Vancouver, ISO, etc.
3

Garić-Demirović, M., M. R. S. Kulenović et M. Nurkanović. « Global Dynamics of Certain Homogeneous Second-Order Quadratic Fractional Difference Equation ». Scientific World Journal 2013 (2013) : 1–10. http://dx.doi.org/10.1155/2013/210846.

Texte intégral
Résumé :
We investigate the basins of attraction of equilibrium points and minimal period-two solutions of the difference equation of the formxn+1=xn-12/(axn2+bxnxn-1+cxn-12),n=0,1,2,…,where the parameters a, b, and c are positive numbers and the initial conditionsx-1andx0are arbitrary nonnegative numbers. The unique feature of this equation is the coexistence of an equilibrium solution and the minimal period-two solution both of which are locally asymptotically stable.
Styles APA, Harvard, Vancouver, ISO, etc.
4

Ivanov, Ivan G. « ITERATIVE COMPUTING THE MINIMAL SOLUTION OF THE COUPLED NONLINEAR MATRIX EQUATIONS IN TERMS OF NONNEGATIVE MATRICES ». Annals of the Academy of Romanian Scientists Series on Mathematics and Its Application 12, no 1-2 (2020) : 226–37. http://dx.doi.org/10.56082/annalsarscimath.2020.1-2.226.

Texte intégral
Résumé :
We investigate a set of nonlinear matrix equations with nonnegative matrix coefficients which has arisen in applied sciences. There are papers where the minimal nonnegative solution of the set of nonlinear matrix equations is computed applying the different procedures. The alternate linear implicit method and its modifications have intensively investigated because they have simple computational scheme. We construct a new decoupled modification of the alternate linear implicit procedure to compute the minimal nonnegative solution of the considered set of equations. The convergence properties of the proposed iteration are derived and a sufficient condition for convergence is derived. The performance of the proposed algorithm is illustrated on several numerical examples. On the basis of the experiments we derive conclusions for applicability of the computational schemes.
Styles APA, Harvard, Vancouver, ISO, etc.
5

Hammoudi, Alaaeddine, Oana Iosifescu et Martial Bernoux. « Mathematical analysis of a spatially distributed soil carbon dynamics model ». Analysis and Applications 15, no 06 (2 août 2017) : 771–93. http://dx.doi.org/10.1142/s0219530516500081.

Texte intégral
Résumé :
The aim of this paper is to study the mathematical properties of a new model of soil carbon dynamics which is a reaction–diffusion–advection system with a quadratic reaction term. This is a spatial version of Modeling Organic changes by Micro-Organisms of Soil model, recently introduced by M. Pansu and his group. We show here that for any nonnegative initial condition, there exists a unique nonnegative weak solution. Moreover, if we assume time periodicity of model entries, taking into account seasonal effects, we prove existence of a minimal and a maximal periodic weak solution. In a particular case, these two solutions coincide and they become a global attractor of any bounded solution of the periodic system.
Styles APA, Harvard, Vancouver, ISO, etc.
6

Zhang, Xuemei, Xiaozhong Yang et Meiqiang Feng. « Minimal Nonnegative Solution of Nonlinear Impulsive Differential Equations on Infinite Interval ». Boundary Value Problems 2011 (2011) : 1–15. http://dx.doi.org/10.1155/2011/684542.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

Ivanshin, Pyotr. « Functions of Minimal Norm with the Given Set of Fourier Coefficients ». Mathematics 7, no 7 (20 juillet 2019) : 651. http://dx.doi.org/10.3390/math7070651.

Texte intégral
Résumé :
We prove the existence and uniqueness of the solution of the problem of the minimum norm function ∥ · ∥ ∞ with a given set of initial coefficients of the trigonometric Fourier series c j , j = 0 , 1 , … , 2 n . Then, we prove the existence and uniqueness of the solution of the nonnegative function problem with a given set of coefficients of the trigonometric Fourier series c j , j = 1 , … , 2 n for the norm ∥ · ∥ 1 .
Styles APA, Harvard, Vancouver, ISO, etc.
8

Guo, Chun-Hua. « A note on the minimal nonnegative solution of a nonsymmetric algebraic Riccati equation ». Linear Algebra and its Applications 357, no 1-3 (décembre 2002) : 299–302. http://dx.doi.org/10.1016/s0024-3795(02)00431-7.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

Zhang, Lihong, Bashir Ahmad et Guotao Wang. « Monotone iterative method for a class of nonlinear fractional differential equations on unbounded domains in Banach spaces ». Filomat 31, no 5 (2017) : 1331–38. http://dx.doi.org/10.2298/fil1705331z.

Texte intégral
Résumé :
In this paper, we investigate the existence of minimal nonnegative solution for a class of nonlinear fractional integro-differential equations on semi-infinite intervals in Banach spaces by applying the cone theory and the monotone iterative technique. An example is given for the illustration of main results.
Styles APA, Harvard, Vancouver, ISO, etc.
10

Miyajima, Shinya. « Fast verified computation for the minimal nonnegative solution of the nonsymmetric algebraic Riccati equation ». Computational and Applied Mathematics 37, no 4 (13 février 2018) : 4599–610. http://dx.doi.org/10.1007/s40314-018-0590-x.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
Plus de sources

Thèses sur le sujet "Minimal nonnegative solution"

1

Addis, Elena. « Elementwise accurate algorithms for nonsymmetric algebraic Riccati equations associated with M-matrices ». Doctoral thesis, 2022. http://hdl.handle.net/2158/1275470.

Texte intégral
Résumé :
We present an elementwise accurate algorithm which incorporates the shift technique for the computation of the minimal non negative solution of a nonsymmetric algebraic Riccati equation associated to M, when M is an irreducible singular M-matrix. We propose the idea of delayed shift and some results that guarantees the applicability and the convergence of structured doubling algorithm based only on the properties of the matrix of the initial setup of doubling algorithm instead of matrix M. We provide a componentwise error analysis for the algorithm and we also show some numerical experiments that illustrate the advantage in terms of accuracy and convergence speed.
Styles APA, Harvard, Vancouver, ISO, etc.

Chapitres de livres sur le sujet "Minimal nonnegative solution"

1

Bakonyi, Mihály, et Hugo J. Woerdeman. « Hermitian and related completion problems ». Dans Matrix Completions, Moments, and Sums of Hermitian Squares. Princeton University Press, 2011. http://dx.doi.org/10.23943/princeton/9780691128894.003.0005.

Texte intégral
Résumé :
This chapter considers various completion problems that are in one way or another closely related to positive semidefinite or contractive completion problems. For instance, as a variation on requiring that all eigenvalues of the completion are positive/nonnegative, one can consider the question how many eigenvalues of a Hermitian completion have to be positive/nonnegative. In the solution to the latter problem ranks of off-diagonal parts will play a role, which is why minimal rank completions are also discussed. Related is a question on real measures on the real line. As a variation of the contractive completion problem, the chapter considers the question how many singular values of a completion have to be smaller (or larger) than one. It also looks at completions in classes of normal matrices and distance matrices. As applications it turns to questions regarding Hermitian matrix expressions, a minimal representation problem for discrete systems, and the separability problem that appears in quantum information. Exercises and notes are provided at the end of the chapter.
Styles APA, Harvard, Vancouver, ISO, etc.

Actes de conférences sur le sujet "Minimal nonnegative solution"

1

Fabien, Brian C. « A Simple Continuation Method for the Solution of Optimal Control Problems With State Variable Inequality Constraints ». Dans ASME 2013 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2013. http://dx.doi.org/10.1115/detc2013-13617.

Texte intégral
Résumé :
This paper develops a simple continuation method for the approximate solution of optimal control problems with pure state variable inequality constraints. The method is based on transforming the inequality constraints into equality constraints using nonnegative slack variables. The resultant equality constraints are satisfied approximately using a quadratic loss penalty function. The solution of the original problem is obtained by solving the transformed problem with a sequence of penalty weights that tends to zero. The penalty weight is treated as the continuation parameter. The necessary conditions for a minimum are written as a boundary value problem involving index-1 differential-algebraic equations (BVP-DAE). The BVP-DAE include the complementarity conditions associated with the inequality constraints. The paper shows that the necessary conditions for optimality of the original problem and the transformed problems are remarkably similar. In particular, the BVP-DAE for each problem differ by a linear term related to the Lagrange multipliers associated with the state variable inequality constraints. Numerical examples are presented to illustrate the efficacy of the proposed technique. Specifically, the paper presents results for; (1) the optimal control of a simplified model of a gantry crane system, (2) the optimal control of a rigid body moving in the vertical plane, and (3) the trajectory optimization of a planar two-link robot. All problems include pure state variable inequality constraints.
Styles APA, Harvard, Vancouver, ISO, etc.
2

Liu, Kai, et Hua Wang. « High-Order Co-Clustering via Strictly Orthogonal and Symmetric L1-Norm Nonnegative Matrix Tri-Factorization ». Dans Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California : International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/340.

Texte intégral
Résumé :
Different to traditional clustering methods that deal with one single type of data, High-Order Co- Clustering (HOCC) aims to cluster multiple types of data simultaneously by utilizing the inter- or/and intra-type relationships across different data types. In existing HOCC methods, data points routinely enter the objective functions with squared residual errors. As a result, outlying data samples can dominate the objective functions, which may lead to incorrect clustering results. Moreover, existing methods usually suffer from soft clustering, where the probabilities to different groups can be very close. In this paper, we propose an L1 -norm symmetric nonnegative matrix tri-factorization method to solve the HOCC problem. Due to the orthogonal constraints and the symmetric L1 -norm formulation in our new objective, conventional auxiliary function approach no longer works. Thus we derive the solution algorithm using the alternating direction method of multipliers. Extensive experiments have been conducted on a real world data set, in which promising empirical results, including less time consumption, strictly orthogonal membership matrix, lower local minima etc., have demonstrated the effectiveness of our proposed method.
Styles APA, Harvard, Vancouver, ISO, etc.
Vous pouvez également être intéressé par les bibliographies sur le sujet « Minimal nonnegative solution » pour d’autres types de sources :
Articles de revues
Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!

Vers la bibliographie