Relevant bibliographies by topics / Iteration method

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Iteration method'

Author: Grafiati
Published: 4 June 2021
Last updated: 21 February 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Iteration method.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Iteration method"

1

Maibed, Zena Hussein, and Ali Qasem Thajil. "Zenali Iteration Method For Approximating Fixed Point of A δZA - Quasi Contractive mappings." Ibn AL- Haitham Journal For Pure and Applied Sciences 34, no. 4 (October 20, 2021): 78–92. http://dx.doi.org/10.30526/34.4.2705.

Full text
Abstract:
This article will introduce a new iteration method called the zenali iteration method for the approximation of fixed points. We show that our iteration process is faster than the current leading iterations like Mann, Ishikawa, oor, D- iterations, and *- iteration for new contraction mappings called quasi contraction mappings. And we proved that all these iterations (Mann, Ishikawa, oor, D- iterations and *- iteration) equivalent to approximate fixed points of quasi contraction. We support our analytic proof by a numerical example, data dependence result for contraction mappings type by employing zenali iteration also discussed.
APA, Harvard, Vancouver, ISO, and other styles
2

Zhong, Deyun, Liguan Wang, Jinmiao Wang, and Mingtao Jia. "An Efficient Mine Ventilation Solution Method Based on Minimum Independent Closed Loops." Energies 13, no. 22 (November 10, 2020): 5862. http://dx.doi.org/10.3390/en13225862.

Full text
Abstract:
In this paper, according to the analysis of optimum circuits, we present an efficient ventilation network solution based on minimum independent closed loops. Our main contribution is optimizing the circuit dividing strategy to improve the iteration convergence and the efficiency of a single iteration. In contrast to a traditional circuit, a minimum closed loop may contain one or more co-tree branches but fewer high-resistance branches and fan branches. It is helpful in solving the problem of divergence or slow convergence for complex ventilation networks. Moreover, we analyze the dividing rules of closed loops and improve the dividing algorithm of minimum independent closed loops. Compared with the traditional Hardy Cross iteration method, the improved solution method has better iteration convergence and computation efficiency. The experimental results of real-world mine ventilation networks show that the improved solution method converges rapidly within a small number of iterations. We also investigate the influence of network complexity, iterative precision, and initial airflow on the iteration convergence.
APA, Harvard, Vancouver, ISO, and other styles
3

Sun, Zhen, and Zilong Zou. "Towards an efficient method of predicting vehicle-induced response of bridge." Engineering Computations 33, no. 7 (October 3, 2016): 2067–89. http://dx.doi.org/10.1108/ec-02-2015-0034.

Full text
Abstract:
Purpose The purpose of this paper is to present a practical and efficient iterative method for predicting vehicle-induced response of bridge. Design/methodology/approach The vehicle-bridge interaction (VBI) problem is generalized mathematically and a computational algorithm for VBI is proposed. This method rests on an iterative procedure, which utilizes the whole interaction process for iteration. By this means, vehicle and bridge become totally uncoupled and are only linked by the contact force history. This method provides flexibility to choose simplified or refined vehicle and bridge models for the VBI problem, as well as open options for different commercial FEM software without specialized codes. Findings The method is verified through two numerical examples. The first example uses a simple 1D beam bridge model, which illustrates the procedure of this method and demonstrates its fast convergence in several iterations. The second example employs a realistic full 3D finite element bridge model, which shows that the method easily connects complex FEM bridge models in ABAQUS with a calibrated vehicle model in Matlab. The dynamic response of the bridge is reliably calculated within only a few iterations. Originality/value The proposed iterative method separates vehicle and bridge into independent subsystems in the computational process, thus providing more flexibility to utilize commercial FEM softwares. Its efficiency is realized through choosing the whole interaction force process for iteration, which considerably reduces the iteration steps.
APA, Harvard, Vancouver, ISO, and other styles
4

Zhao, Duo, and Yong Yang. "An Iterative Learning Control Design Method for Nonlinear Discrete-Time Systems with Unknown Iteration-Varying Parameters and Control Direction." Mathematical Problems in Engineering 2016 (2016): 1–7. http://dx.doi.org/10.1155/2016/8971407.

Full text
Abstract:
An iterative learning control (ILC) scheme is designed for a class of nonlinear discrete-time dynamical systems with unknown iteration-varying parameters and control direction. The iteration-varying parameters are described by a high-order internal model (HOIM) such that the unknown parameters in the current iteration are a linear combination of the counterparts in the previous certain iterations. Under the framework of ILC, the learning convergence condition is derived through rigorous analysis. It is shown that the adaptive ILC law can achieve perfect tracking of system state in presence of iteration-varying parameters and unknown control direction. The effectiveness of the proposed control scheme is verified by simulations.
APA, Harvard, Vancouver, ISO, and other styles
5

Rehman, Habib ur, Poom Kumam, Ioannis K. Argyros, Nasser Aedh Alreshidi, Wiyada Kumam, and Wachirapong Jirakitpuwapat. "A Self-Adaptive Extra-Gradient Methods for a Family of Pseudomonotone Equilibrium Programming with Application in Different Classes of Variational Inequality Problems." Symmetry 12, no. 4 (April 2, 2020): 523. http://dx.doi.org/10.3390/sym12040523.

Full text
Abstract:
The main objective of this article is to propose a new method that would extend Popov’s extragradient method by changing two natural projections with two convex optimization problems. We also show the weak convergence of our designed method by taking mild assumptions on a cost bifunction. The method is evaluating only one value of the bifunction per iteration and it is uses an explicit formula for identifying the appropriate stepsize parameter for each iteration. The variable stepsize is going to be effective for enhancing iterative algorithm performance. The variable stepsize is updating for each iteration based on the previous iterations. After numerical examples, we conclude that the effect of the inertial term and variable stepsize has a significant improvement over the processing time and number of iterations.
APA, Harvard, Vancouver, ISO, and other styles
6

Liu, Yi Di. "Research on Iterative Method in Solving Linear Equations on the Hadoop Platform." Applied Mechanics and Materials 347-350 (August 2013): 2763–68. http://dx.doi.org/10.4028/www.scientific.net/amm.347-350.2763.

Full text
Abstract:
Solving linear equations is ubiquitous in many engineering problems, and iterative method is an efficient way to solve this question. In this paper, we propose a general iteration method for solving linear equations. Our general iteration method doesnt contain denominators in its iterative formula, and this relaxes the limits that traditional iteration methods require the coefficient aii to be non-zero. Moreover, as there is no division operation, this method is more efficient. We implement this method on the Hadoop platform, and compare it with the Jacobi iteration, the Guass-Seidel iteration and the SOR iteration. Experiments show that our proposed general iteration method is not only more efficient, but also has a good scalability.
APA, Harvard, Vancouver, ISO, and other styles
7

Tian, Zhaolu, Xiaoyan Liu, Yudong Wang, and P. H. Wen. "The modified matrix splitting iteration method for computing PageRank problem." Filomat 33, no. 3 (2019): 725–40. http://dx.doi.org/10.2298/fil1903725t.

Full text
Abstract:
In this paper, based on the iteration methods [3,10], we propose a modified multi-step power-inner-outer (MMPIO) iteration method for solving the PageRank problem. In the MMPIO iteration method, we use the multi-step matrix splitting iterations instead of the power method, and combine with the inner-outer iteration [24]. The convergence of the MMPIO iteration method is analyzed in detail, and some comparison results are also given. Several numerical examples are presented to illustrate the effectiveness of the proposed algorithm.
APA, Harvard, Vancouver, ISO, and other styles
8

Cao, Jing. "Inner Sequential Single Solid Method for Layout Optimization of Multi-Materials." Journal of Physics: Conference Series 2235, no. 1 (May 1, 2022): 012091. http://dx.doi.org/10.1088/1742-6596/2235/1/012091.

Full text
Abstract:
Abstract In multiple materials layout optimization, the optimal solution is difficult to achieve due to the number of design variables being too large and the material interpolation scheme becoming complicated when using density-like method. To bypass this problem, an inner sequential single solid optimization (ISSSO) method is presented in this study. There are two types of iterations in the optimization process of this method: the inner and outer iterations. In the inner iteration, the original layout optimization of many materials is replaced with a series of single solid sub-optimizations. In each sub-optimization, only one solid is chosen to update and the rest keeps unchanged. The inner iteration stops when all the solids are updated consequently. The next loop of inner iteration starts when the current solution does not meet the requirement of convergence. The outer iteration starts only if the current inner iteration comes to an end. In the outer iteration, the new inner iterations for update of all the solid materials are carried out. The effectiveness of ISSSO method is verified by comparing the calculation results with other methods.
APA, Harvard, Vancouver, ISO, and other styles
9

Li, Xu, Yu-Jiang Wu, Ai-Li Yang, and Jin-Yun Yuan. "A Generalized HSS Iteration Method for Continuous Sylvester Equations." Journal of Applied Mathematics 2014 (2014): 1–9. http://dx.doi.org/10.1155/2014/578102.

Full text
Abstract:
Based on the Hermitian and skew-Hermitian splitting (HSS) iteration technique, we establish a generalized HSS (GHSS) iteration method for solving large sparse continuous Sylvester equations with non-Hermitian and positive definite/semidefinite matrices. The GHSS method is essentially a four-parameter iteration which not only covers the standard HSS iteration but also enables us to optimize the iterative process. An exact parameter region of convergence for the method is strictly proved and a minimum value for the upper bound of the iterative spectrum is derived. Moreover, to reduce the computational cost, we establish an inexact variant of the GHSS (IGHSS) iteration method whose convergence property is discussed. Numerical experiments illustrate the efficiency and robustness of the GHSS iteration method and its inexact variant.
APA, Harvard, Vancouver, ISO, and other styles
10

Al-shameri, Wadia Faid Hassan, and Mohamed El Sayed. "Fractals Generated via Numerical Iteration Method." Fractal and Fractional 6, no. 4 (March 31, 2022): 196. http://dx.doi.org/10.3390/fractalfract6040196.

Full text
Abstract:
In this research article, a modified algorithm for the generation of a fractal pattern resulting from the iteration of an algebraic function using the numerical iteration method is presented. This fractal pattern shows the dynamical behavior of the numerical iterations. A nonstandard convergence test of the displayable fractal pattern was applied.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Iteration method"

1

Wilkins, Bryce Daniel. "The E² Bathe subspace iteration method." Thesis, Massachusetts Institute of Technology, 2019. https://hdl.handle.net/1721.1/122238.

Full text
Abstract:
Thesis: S.M., Massachusetts Institute of Technology, Department of Mechanical Engineering, 2019
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 91-93).
Since its development in 1971, the Bathe subspace iteration method has been widely-used to solve the generalized symmetric-definite eigenvalue problem. The method is particularly useful for solving large eigenvalue problems when only a few of the least dominant eigenpairs are sought. In reference [18], an enriched subspace iteration method was proposed that accelerated the convergence of the basic method by replacing some of the iteration vectors with more effective turning vectors. In this thesis, we build upon this recent acceleration effort and further enrich the subspace of each iteration by replacing additional iteration vectors with our new turning-of-turning vectors. We begin by reviewing the underpinnings of the subspace iteration methodology. Then, we present the steps of our new algorithm, which we refer to as the Enriched- Enriched (E2 ) Bathe subspace iteration method. This is followed by a tabulation of the number of floating point operations incurred during a general iteration of the E2 algorithm. Additionally, we perform a simplified convergence analysis showing that the E2 method converges asymptotically at a faster rate than the enriched method. Finally, we examine the results from several test problems that were used to illustrate the E2 method and to assess its potential computational savings compared to the enriched method. The sample results for the E2 method are consistent with the theoretical asymptotic convergence rate that was obtained in our convergence analysis. Further, the results from the CPU time tests suggest that the E2 method can often provide a useful reduction in computational effort compared to the enriched method, particularly when relatively few iteration vectors are used in comparison with the number of eigenpairs that are sought.
by Bryce Daniel Wilkins.
S.M.
S.M. Massachusetts Institute of Technology, Department of Mechanical Engineering
APA, Harvard, Vancouver, ISO, and other styles
2

Chen, Fan. "DISTANCE FIELD TRANSFORM WITH AN ADAPTIVE ITERATION METHOD." Kent State University / OhioLINK, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=kent1255727002.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Freitag, Melina. "Inner-outer iterative methods for eigenvalue problems : convergence and preconditioning." Thesis, University of Bath, 2007. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.512248.

Full text
Abstract:
Many methods for computing eigenvalues of a large sparse matrix involve shift-invert transformations which require the solution of a shifted linear system at each step. This thesis deals with shift-invert iterative techniques for solving eigenvalue problems where the arising linear systems are solved inexactly using a second iterative technique. This approach leads to an inner-outer type algorithm. We provide convergence results for the outer iterative eigenvalue computation as well as techniques for efficient inner solves. In particular eigenvalue computations using inexact inverse iteration, the Jacobi-Davidson method without subspace expansion and the shift-invert Arnoldi method as a subspace method are investigated in detail. A general convergence result for inexact inverse iteration for the non-Hermitian generalised eigenvalue problem is given, using only minimal assumptions. This convergence result is obtained in two different ways; on the one hand, we use an equivalence result between inexact inverse iteration applied to the generalised eigenproblem and modified Newton's method; on the other hand, a splitting method is used which generalises the idea of orthogonal decomposition. Both approaches also include an analysis for the convergence theory of a version of inexact Jacobi-Davidson method, where equivalences between Newton's method, inverse iteration and the Jacobi-Davidson method are exploited. To improve the efficiency of the inner iterative solves we introduce a new tuning strategy which can be applied to any standard preconditioner. We give a detailed analysis on this new preconditioning idea and show how the number of iterations for the inner iterative method and hence the total number of iterations can be reduced significantly by the application of this tuning strategy. The analysis of the tuned preconditioner is carried out for both Hermitian and non-Hermitian eigenproblems. We show how the preconditioner can be implemented efficiently and illustrate its performance using various numerical examples. An equivalence result between the preconditioned simplified Jacobi-Davidson method and inexact inverse iteration with the tuned preconditioner is given. Finally, we discuss the shift-invert Arnoldi method both in the standard and restarted fashion. First, existing relaxation strategies for the outer iterative solves are extended to implicitly restarted Arnoldi's method. Second, we apply the idea of tuning the preconditioner to the inner iterative solve. As for inexact inverse iteration the tuned preconditioner for inexact Arnoldi's method is shown to provide significant savings in the number of inner solves. The theory in this thesis is supported by many numerical examples.
APA, Harvard, Vancouver, ISO, and other styles
4

Kim, Ki-Tae Ph D. Massachusetts Institute of Technology. "The enriched subspace iteration method and wave propagation dynamics with overlapping finite elements." Thesis, Massachusetts Institute of Technology, 2018. http://hdl.handle.net/1721.1/119346.

Full text
Abstract:
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mechanical Engineering, 2018.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 133-137).
In structural dynamic problems, the mode superposition method is the most widely used solution approach. The largest computational effort (about 90% of the total solution time) in the mode superposition method is spent on calculating the required eigenpairs and it is of critical importance to develop effective eigensolvers. We present in this thesis a novel solution scheme for the generalized eigenvalue problem. The scheme is an extension of the Bathe subspace iteration method and a significant reduction in computational time is achieved. For the solution of wave propagation problems, the finite element method with direct time integration has been extensively employed. However, using the traditional finite element solution approach, accurate solutions can only be obtained of rather simple one-dimensional wave propagation problems. In this thesis, we investigate the solution characteristics of a solution scheme using 'overlapping finite elements', disks and novel elements, enriched with harmonic functions and the Bathe implicit time integration method to solve transient wave propagation problems. The proposed solution scheme shows two important properties: monotonic convergence of calculated solutions with decreasing time step size and a solution accuracy almost independent of the direction of wave travel through uniform, or distorted, meshes. These properties make the scheme promising to solve general wave propagation problems in complex geometries involving multiple waves.
by Ki-Tae Kim.
Ph. D.
APA, Harvard, Vancouver, ISO, and other styles
5

Altintan, Derya. "An Extension To The Variational Iteration Method For Systems And Higher-order Differential Equations." Phd thesis, METU, 2011. http://etd.lib.metu.edu.tr/upload/12613864/index.pdf.

Full text
Abstract:
It is obvious that differential equations can be used to model real-life problems. Although it is possible to obtain analytical solutions of some of them, it is in general difficult to find closed form solutions of differential equations. Finding thus approximate solutions has been the subject of many researchers from different areas. In this thesis, we propose a new approach to Variational Iteration Method (VIM) to obtain the solutions of systems of first-order differential equations. The main contribution of the thesis to VIM is that proposed approach uses restricted variations only for the nonlinear terms and builds up a matrix-valued Lagrange multiplier that leads to the extension of the method (EVIM). Close relation between the matrix-valued Lagrange multipliers and fundamental solutions of the differential equations highlights the relation between the extended version of the variational iteration method and the classical variation of parameters formula. It has been proved that the exact solution of the initial value problems for (nonhomogenous) linear differential equations can be obtained by such a generalisation using only a single variational step. Since higher-order equations can be reduced to first-order systems, the proposed approach is capable of solving such equations too
indeed, without such a reduction, variational iteration method is also extended to higher-order scalar equations. Further, the close connection with the associated first-order systems is presented. Such extension of the method to higher-order equations is then applied to solve boundary value problems: linear and nonlinear ones. Although the corresponding Lagrange multiplier resembles the Green&rsquo
s function, without the need of the latter, the extended approach to the variational iteration method is systematically applied to solve boundary value problems, surely in the nonlinear case as well. In order to show the applicability of the method, we have applied the EVIM to various real-life problems: the classical Sturm-Liouville eigenvalue problems, Brusselator reaction-diffusion, and chemical master equations. Results show that the method is simple, but powerful and effective.
APA, Harvard, Vancouver, ISO, and other styles
6

Lohaka, Hippolyte O. "MAKING A GROUPED-DATA FREQUENCY TABLE: DEVELOPMENT AND EXAMINATION OF THE ITERATION ALGORITHM." Ohio : Ohio University, 2007. http://www.ohiolink.edu/etd/view.cgi?ohiou1194981215.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Tan, Li. "A Computational Iteration Method to Analyze Mechanics of Timing Belt Systems with Non-Circular Pulleys." Thesis, Virginia Tech, 2018. http://hdl.handle.net/10919/84991.

Full text
Abstract:
Timing belt systems, usually consisting of a toothed belt and multiple pulleys, are used in many mechanical devices, especially in the internal combustion engine to synchronize the rotation of the crankshafts and the camshafts. When the system operates, the belt teeth will be transmitted by the pulley teeth meshed with them. Timing belt drives can make sure that the engine' s valves open and close properly due to their precise transmission ratio. In this thesis, a quasi-static computational model is developed to calculate the belt load distributions and the torques around pulleys for different timing belt systems. The simplest system is a two-pulley system with one oval pulley and one circular pulley. This computational model is then extended to a two-pulley system with one special-shaped pulley and finally generalized to determine the load conditions for a multi-pulley system with multiple special-shaped pulleys. Belt tooth deflections, tooth loads, belt tension distributions, friction forces, and the effect of friction hysteresis have been taken into consideration. Results of these quantities are solved by a nested numerical iteration method. Periodic torques generated by the varied radius of noncircular pulley are calculated by this computational model to cancel the undesired external cyclic torque, which will increase the life of timing belts.
Master of Science
APA, Harvard, Vancouver, ISO, and other styles
8

Massa, Julio Cesar. "Acceleration of convergence in solving the eigenvalue problem by matrix iteration using the power method." Thesis, Virginia Polytechnic Institute and State University, 1985. http://hdl.handle.net/10919/101452.

Full text
Abstract:
A modification of the matrix iteration using the power method, in conjunction with Hotelling deflation, for the solution of the problem K.x = ω².M.x is here proposed. The problem can be written in the form D.x =λ.x, and the modification consists of raising the matrix D to an appropriate power p before carrying out the iteration process. The selection of a satisfactory value of p is investigated, based on the spacing between the eigenvalues. The effect of p on the accuracy of the results is also discussed.
M.S.
APA, Harvard, Vancouver, ISO, and other styles
9

Andersson, Tomas. "An iterative solution method for p-harmonic functions on finite graphs with an implementation." Thesis, Linköping University, Department of Mathematics, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-18162.

Full text
Abstract:

In this paper I give a description and derivation of Dirichlet's problem, a boundary value problem, for p-harmonic functions on graphs and study an iterative method for solving it.The method's convergence is proved and some preliminary results about its speed of convergence are presented.There is an implementation accompanying this thesis and a short description of the implementation is included. The implementation will be made available on the internet at http://www.mai.liu.se/~anbjo/pharmgraph/ for as long as possible.

APA, Harvard, Vancouver, ISO, and other styles
10

Byers, R., C. He, and V. Mehrmann. "The Matrix Sign Function Method and the Computation of Invariant Subspaces." Universitätsbibliothek Chemnitz, 1998. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-199800619.

Full text
Abstract:
A perturbation analysis shows that if a numerically stable procedure is used to compute the matrix sign function, then it is competitive with conventional methods for computing invariant subspaces. Stability analysis of the Newton iteration improves an earlier result of Byers and confirms that ill-conditioned iterates may cause numerical instability. Numerical examples demonstrate the theoretical results.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Iteration method"

1

Zhu, Lian-di. A streamline-iteration method for calculating turbulent flow around the stern of a body of revolution and its wake. Wuxi, Jiansu, China: China Scientific Research Center, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Deville, M. O. Fourier analysis of finite element preconditioned collocation schemes. Hampton, Va: National Aeronautics and Space Administration, Langley Research Center, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Deville, M. O. Fourier analysis of finite element preconditioned collocation schemes. Hampton, Va: National Aeronautics and Space Administration, Langley Research Center, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

1951-, Ésik Zoltán, ed. Iteration theories: The equational logic of iterative processes. Berlin: Springer-Verlag, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Bloom, Stephen L. Iteration Theories: The Equational Logic of Iterative Processes. Berlin, Heidelberg: Springer Berlin Heidelberg, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Eremin, I. I. (Ivan Ivanovich), ed. Operators and iterative processes of Fejér type: Theory and applications. Berlin: Walter de Gruyter, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Widlund, Olof. Optimal iterative refinement method. New York: Courant Institute of Mathematical Sciences, New York University, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Byrne, C. L. Applied iterative methods. Wellesley, Mass: AK Peters, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Axelsson, O. Iterative solution methods. Cambridge [England]: Cambridge University Press, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Johnston, Catherine M. Simultaneous iteration methods for the eigenproblem. [s.l: The Author], 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Iteration method"

1

Marinca, Vasile, and Nicolae Herisanu. "Optimal Parametric Iteration Method." In Nonlinear Dynamical Systems in Engineering, 313–84. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22735-6_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Neuberger, J. W. "An Analytic Iteration Method." In Lecture Notes in Mathematics, 187–91. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-04041-2_22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Dong, Qiao-Li, Yeol Je Cho, Songnian He, Panos M. Pardalos, and Themistocles M. Rassias. "The Krasnosel’skiı̆–Mann Iteration." In The Krasnosel'skiĭ-Mann Iterative Method, 29–47. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-91654-1_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Marinca, Vasile, and Nicolae Herisanu. "The Optimal Variational Iteration Method." In Nonlinear Dynamical Systems in Engineering, 259–311. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22735-6_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Axelsson, O., and W. Layton. "Iteration method as discretization procedures." In Lecture Notes in Mathematics, 174–93. Berlin, Heidelberg: Springer Berlin Heidelberg, 1990. http://dx.doi.org/10.1007/bfb0090908.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Neuberger, John William. "A related analytic iteration method." In Lecture Notes in Mathematics, 135–38. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/bfb0092847.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Dong, Qiao-Li, Yeol Je Cho, Songnian He, Panos M. Pardalos, and Themistocles M. Rassias. "The Inertial Krasnosel’skiı̆–Mann Iteration." In The Krasnosel'skiĭ-Mann Iterative Method, 59–73. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-91654-1_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Eidelman, Yuli, Israel Gohberg, and Iulian Haimovici. "The QR Iteration Method for Eigenvalues." In Separable Type Representations of Matrices and Fast Algorithms, 135–62. Basel: Springer Basel, 2013. http://dx.doi.org/10.1007/978-3-0348-0612-1_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Argyros, Ioannis K. "An Inverse Free Broyden's Method." In The Theory and Applications of Iteration Methods, 273–88. 2nd ed. Boca Raton: CRC Press, 2021. http://dx.doi.org/10.1201/9781003128915-13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Argyros, Ioannis K. "Efficient Sixth Convergence Order Method." In The Theory and Applications of Iteration Methods, 161–74. 2nd ed. Boca Raton: CRC Press, 2021. http://dx.doi.org/10.1201/9781003128915-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Iteration method"

1

Gutfinger, Ron S., and Raj Abraham. "Subsmoothing: An Optimized Smoothing Method." In ASME 1993 International Computers in Engineering Conference and Exposition. American Society of Mechanical Engineers, 1993. http://dx.doi.org/10.1115/cie1993-0014.

Full text
Abstract:
Abstract Usually, a mesh created by an automatic mesh generator is of low quality. In order to improve the mesh quality, a smoothing algorithm is applied on the mesh. The result is a mesh ready for analysis. The smoothing is a CPU intensive iterative process. In some cases, smoothing may take longer than the initial mesh creation. In this work an optimized smoothing algorithm is presented. While iterating, the algorithm recognizes nodes that are sufficiently smoothed, and ignores them in subsequent iterations. Progressively, a smaller and smaller subset of nodes is smoothed. The result is less CPU time spent per iteration, and some decrease in the total number of iterations. This method, called subsmoothing, is applied on Laplacian smoothing of shell meshes. Examples show 30% CPU time savings and little change in mesh quality (¼%).
APA, Harvard, Vancouver, ISO, and other styles
2

Barton, Kira, Andrew Alleyne, and Doug Bristow. "An Improved Method for Calculating Iterative Learning Control Convergence Rate." In ASME 2008 Dynamic Systems and Control Conference. ASMEDC, 2008. http://dx.doi.org/10.1115/dscc2008-2180.

Full text
Abstract:
In Iterative Learning Control (ILC), the lifted system is often used in design and analysis to determine convergence rate of the learning algorithm. Computation of the convergence rate in the lifted setting requires construction of large NxN matrices, where N is the number of data points in an iteration. The convergence rate computation is O(N2) and is typically limited to short iteration lengths because of computational memory constraints. In this article, we present an alternative method for calculating the convergence rate without the need of large matrix calculations. This method uses the implicitly restarted Arnoldi method and dynamic simulations to calculate the ILC norm, reducing the calculation to O(N). In addition to faster computation, we are able to calculate the convergence rate for long iteration lengths. This method is presented for multi-input multi-output, linear time-varying discrete-time systems.
APA, Harvard, Vancouver, ISO, and other styles
3

Mohamed‐Jawad, Anwar Ja’afar. "Variational Iteration Method in Solving Evolution Equations." In ICMS INTERNATIONAL CONFERENCE ON MATHEMATICAL SCIENCE. American Institute of Physics, 2010. http://dx.doi.org/10.1063/1.3525153.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Wang, Yi, Liangguo Dong, Benxin Chi, and Zhao Xue. "Hybrid iteration method for full waveform inversion." In SEG Technical Program Expanded Abstracts 2012. Society of Exploration Geophysicists, 2012. http://dx.doi.org/10.1190/segam2012-0411.1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Kim, Kyung Soo, and Yong Suk Choi. "Incremental iteration method for fast PageRank computation." In IMCOM '15: The 9th International Conference on Ubiquitous Information Management and Communication. New York, NY, USA: ACM, 2015. http://dx.doi.org/10.1145/2701126.2701165.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

He, Zehao, Kexuan Liu, Xiaomeng Sui, and Liangcai Cao. "Full-Color Holographic Display with Enhanced Image Quality by Iterative Angular-Spectrum Method." In Digital Holography and Three-Dimensional Imaging. Washington, D.C.: Optica Publishing Group, 2022. http://dx.doi.org/10.1364/dh.2022.m6a.3.

Full text
Abstract:
An iterative angular-spectrum method for phase-only holograms is presented. Convolution errors are considered and eliminated during the iteration. Full-color holographic reconstructions with an average promotion of 3.53 dB in peak signal-to-noise ratio are realized.
APA, Harvard, Vancouver, ISO, and other styles
7

Al-Mohssen, Husain A., Nicolas G. Hadjiconstantinou, and Ioannis G. Kevrekidis. "Acceleration Methods for Coarse-Grained Numerical Solution of the Boltzmann Equation." In ASME 4th International Conference on Nanochannels, Microchannels, and Minichannels. ASMEDC, 2006. http://dx.doi.org/10.1115/icnmm2006-96119.

Full text
Abstract:
We present a coarse-grained steady state solution framework for the Boltzmann kinetic equation based on a Newton-Broyden iteration. This approach is an extension of the equation-free framework proposed by Kevrekidis and coworkers, whose objective is the use of fine-scale simulation tools to directly extract coarse-grained, macroscopic information. Our current objective is the development of efficient simulation tools for modeling complex micro/nanoscale flows. The iterative method proposed and used here consists of a short Boltzmann transient evolution step and a Newton-Broyden contraction mapping step based on the Boltzmann solution; the latter step only solves for the macroscopic field of interest (e.g. flow velocity). The predicted macroscopic field is then used as an initial condition for the Boltzmann solver for the next iteration. We have validated this approach for isothermal, one-dimensional flows in the low Knudsen number regime. We find that the Newton-Broyden iteration converges in O(10) iterations, starting from arbitrary guess solutions and a Navier-Stokes based initial Jacobian. This results in computational savings compared to time-explicit integration to steady states when the time to steady state is longer than O(40) mean collision times.
APA, Harvard, Vancouver, ISO, and other styles
8

Pop, Marlena, and Dorina Horatau. "The iteration method for developing creativity in ecodesign." In The 8th International Conference on Advanced Materials and Systems. INCDTP - Leather and Footwear Research Institute (ICPI), Bucharest, Romania, 2020. http://dx.doi.org/10.24264/icams-2020.vi.2.

Full text
Abstract:
The methods of conceptualization, the theories behind the green-products are issues that this paper wants to address. Spiral Iteration is a method developing creativity in ecodesign for textile and leather industries. It will be demonstrated that exploratory and experimental research in textile design was able to validate the spiral iteration tools and the aesthetic tools allowing the creative to express, through specific visual language, a whole individual universe of Cultural Design, as green identity of cultural sustainable idea of the products.
APA, Harvard, Vancouver, ISO, and other styles
9

Fan Chen and Ye Zhao. "Distance field transform with an adaptive iteration method." In 2009 IEEE International Conference on Shape Modeling and Applications (SMI). IEEE, 2009. http://dx.doi.org/10.1109/smi.2009.5170171.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Li, Zi-jun, Mian Liu, Gang Li, and Ben-ying Fang. "Alternating Iteration Method For Solving Monochromatic Electromagnetic Wave." In Proceedings of 2006 International Conference on Machine Learning and Cybernetics. IEEE, 2006. http://dx.doi.org/10.1109/icmlc.2006.259136.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Iteration method"

1

Holliday, D., L. L. Jr DeRaad, and G. J. St-Cyr. Wedge scattering by the method of iteration. Office of Scientific and Technical Information (OSTI), July 1993. http://dx.doi.org/10.2172/10144586.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Миненко, П. А. Обратная нелинейная задача гравиметрии на основе аналогов фильтров Винера–Калмана. Нацiональна академiя наук України, 2008. http://dx.doi.org/10.31812/123456789/5214.

Full text
Abstract:
An iterative method of solution of a nonlinear inverse problem of gravimetry on the basis of the joint application of several cards of the measured field and several vectors of entry conditions for depths up to blocks of rocks in one iteration is developed. Examples of the interpretation of the gravitational field measured in the Western Krivbass are given.
APA, Harvard, Vancouver, ISO, and other styles
3

Prindle, N. H., F. T. Mendenhall, and D. M. Boak. The second iteration of the Systems Prioritization Method: A systems prioritization and decision-aiding tool for the Waste Isolation Pilot Plant: Volume 1, Synopsis of method and results. Office of Scientific and Technical Information (OSTI), May 1996. http://dx.doi.org/10.2172/245628.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Prindle, N. H., D. M. Boak, and R. F. Weiner. The second iteration of the Systems Prioritization Method: A systems prioritization and decision-aiding tool for the Waste Isolation Pilot Plant: Volume 3, Analysis for final programmatic recommendations. Office of Scientific and Technical Information (OSTI), May 1996. http://dx.doi.org/10.2172/251433.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Prindle, N. H., F. T. Mendenhall, K. Trauth, D. M. Boak, W. Beyeler, S. Hora, and D. Rudeen. The second iteration of the Systems Prioritization Method: A systems prioritization and decision-aiding tool for the Waste Isolation Pilot Plant: Volume 2, Summary of technical input and model implementation. Office of Scientific and Technical Information (OSTI), May 1996. http://dx.doi.org/10.2172/244508.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Li, Zhilin, and Kazufumi Ito. Subspace Iteration and Immersed Interface Methods: Theory, Algorithm, and Applications. Fort Belvoir, VA: Defense Technical Information Center, August 2010. http://dx.doi.org/10.21236/ada532686.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Carlin, Bradley P., and Alan E. Gelfand. An Iterative Monte Carlo Method for Nonconjugate Bayesian Analysis. Fort Belvoir, VA: Defense Technical Information Center, September 1992. http://dx.doi.org/10.21236/ada255991.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Sezer, Sefa A., and Ibrahim Çanak. Tauberian Remainder Theorems for Iterations of Methods of Weighted Means. "Prof. Marin Drinov" Publishing House of Bulgarian Academy of Sciences, February 2019. http://dx.doi.org/10.7546/crabs.2019.01.01.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Cai, X.-C. Scalable nonlinear iterative methods for partial differential equations. Office of Scientific and Technical Information (OSTI), October 2000. http://dx.doi.org/10.2172/15013129.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Foulser, David E. Highly Parallel Iterative Methods for Massively Parallel Multiprocessors. Fort Belvoir, VA: Defense Technical Information Center, February 1989. http://dx.doi.org/10.21236/ada206305.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Iteration method' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography