Smale, S. : ‘Algorithms for solving equations’, Proc. Internat. Congress Math. , 1986, pp. 172–195.Wang X H,Han D F,Shen G X.Some remarks on Smale‘s "Algorithms for solving Equations". Act Math Sinica(New Ser) . 1992Smale, S., Algorithms for solving equations, in Proceedings ...
Iteration algorithms for solving a system of fuzzy linear equations In this paper, we discuss the solution of a system of fuzzy linear equations, X=AX+U, and its iteration algorithms where A is a real n×n matrix, the unkno... X Wang,Z Zhong,M Ha - 《Fuzzy Sets & Systems》 被引...
D. Feng and R.B. Schnabel, “Globally convergent parallel algorithms for solving block bordered systems of nonlinear equations”, Optimization Methods and Software 2, 1993, pp. 269–295.Globally convergent Parallel Algorithms for solving block bordered systems on nonlinear equations - Feng, Schnabel ...
In this paper, an iterative algorithm is presented for solving Sylvester tensor equation \mathscr{A}*_M\mathscr{X}+\mathscr{X}*_N\mathscr{C}=\mathscr{D} \mathscr{A}*_M\mathscr{X}+\mathscr{X}*_N\mathscr{C}=\mathscr{D} , where \mathscr{A} \mathscr{A} , \mathscr{C} \mathscr{...
Equation Solving Definition Given a set ofnnonlinear functionsFi(x), wherenis the number of components in the vectorx, the goal of equation solving is to find a vectorxthat makes allFi(x) = 0. fsolveattempts to solve a system of equations by minimizing the sum of squares of the components...
The solution of linear systems of equations using various projection algorithms is considered. Since nonsingularity of the coefficient matrix is the only requirement for convergence, techniques for increasing the rate of convergence are presented. Various criteria for the selection of two and three-dimen...
The motivation for optimizing a p-norm is often given as a facility location problem [1, 6]. Efficient algorithms for solving such problems can be obtained within the framework of convex optimization and barrier methods; see Hertog et al. [17] and Xue and Ye [38] specifically for p-norm...
The radial Schrdinger equation for a spherically symmetric potential can be regarded as a one-dimensional classical harmonic oscillator with a time-dependent spring constant. For solving classical dynamics problems, symplectic integrators are well known for their excellent conservation properties. The class...
Computer science - Algorithms, Complexity, Programming: An algorithm is a specific procedure for solving a well-defined computational problem. The development and analysis of algorithms is fundamental to all aspects of computer science: artificial intell
Good algorithms exist for solving Equation 2 (see [48]); such algorithms typically involve the computation of all eigenvalues of H and a Newton process applied to the secular equation 1Δ−1‖s‖=0. Such algorithms provide an accurate solution to Equation 2. However, they require time ...