Academic literature on the topic 'Implicit iteration'

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 'Implicit iteration.'

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 "Implicit iteration"

1

Chugh, Renu, Preety Malik, and Vivek Kumar. "On a New Faster Implicit Fixed Point Iterative Scheme in Convex Metric Spaces." Journal of Function Spaces 2015 (2015): 1–11. http://dx.doi.org/10.1155/2015/905834.

Full text
Abstract:
The purpose of this paper is to consider a new implicit iteration and study its strong convergence, stability, and data dependence. It is proved through numerical examples that newly introduced iteration has better convergence rate than well known implicit Mann iteration as well as implicit Ishikawa iteration and implicit iterations converge faster as compared to corresponding explicit iterations. Applications of implicit iterations to RNN (Recurrent Neural Networks) analysis are also presented.
APA, Harvard, Vancouver, ISO, and other styles
2

Joodi, Omar Mohammed Abbas, and Zena Hussein Maibed. "On analytical convergence of multi iterative procedure for finite family of generalized contractive." Journal of Interdisciplinary Mathematics 26, no. 7 (2023): 1635–46. http://dx.doi.org/10.47974/jim-1654.

Full text
Abstract:
This paper introduces new iterations type three steps as multi_ implicit Noor iteration, multi_explicit Noor iteration and multi_Picard S-iteration, and defines a generalized quasi-like contractive mapping in convex metric space. Also, the convergence and stability of it are studied. On the other hand, the multi_ implicit Noor iteration is faster than the multi_explicit Noor iteration and multi_Picard S-iteration
APA, Harvard, Vancouver, ISO, and other styles
3

Wang, Cheng, and Zhi Ming Wang. "The Equivalence of Mann and Implicit Mann Iterations for Uniformly Pseudocontractive Mappings in Uniformly Smooth Banach Spaces." Applied Mechanics and Materials 50-51 (February 2011): 718–22. http://dx.doi.org/10.4028/www.scientific.net/amm.50-51.718.

Full text
Abstract:
In this paper, suppose is an arbitrary uniformly smooth real Banach space, and is a nonempty closed convex subset of . Let be a generalized Lipschitzian and uniformly pseudocontractive self-map with . Suppose that , are defined by Mann iteration and implicit Mann iteration respectively, with the iterative parameter satisfying certain conditions. Then the above two iterations that converge strongly to fixed point of are equivalent.
APA, Harvard, Vancouver, ISO, and other styles
4

Rhoades, B. E., and Ştefan M. Şoltuz. "The convergence of an implicit mean value iteration." International Journal of Mathematics and Mathematical Sciences 2006 (2006): 1–7. http://dx.doi.org/10.1155/ijmms/2006/68369.

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

Sablin, M. "An iterative method for solving difference problems of gas dynamics in the mixed Euler-Lagrangian variables." Journal of Physics: Conference Series 2099, no. 1 (2021): 012013. http://dx.doi.org/10.1088/1742-6596/2099/1/012013.

Full text
Abstract:
Abstract The method proposed is intended to solve implicit conservative operator difference schemes for a grid initial-boundary value problems on a simplex grid for a system of equations of gas dynamics in the mixed Euler-Lagrangian variables. To find a solution to such a scheme at a time step, it is represented as a single equation for a nonlinear function of two arguments from space – the direct product of the grid spaces of gas-dynamic quantities. To solve such an equation, a combination of the generalized Gauss-Seidel iterative method (external iterations) and an implicit two-layer iterati
APA, Harvard, Vancouver, ISO, and other styles
6

YEE, H. C., and P. K. SWEBY. "GLOBAL ASYMPTOTIC BEHAVIOR OF ITERATIVE IMPLICIT SCHEMES." International Journal of Bifurcation and Chaos 04, no. 06 (1994): 1579–611. http://dx.doi.org/10.1142/s0218127494001210.

Full text
Abstract:
The global asymptotic nonlinear behavior of some standard iterative procedures in solving nonlinear systems of algebraic equations arising from four implicit linear multistep methods (LMMs) in discretizing three models of 2×2 systems of first-order autonomous nonlinear ordinary differential equations (ODEs) is analyzed using the theory of dynamical systems. The iterative procedures include simple iteration and full and modified Newton iterations. The results are compared with standard Runge-Kutta explicit methods, a noniterative implicit procedure, and the Newton method of solving the steady p
APA, Harvard, Vancouver, ISO, and other styles
7

Yildirim, Isa, and Mujahid Abbas. "Convergence Rate of Implicit Iteration Process and a Data Dependence Result." European Journal of Pure and Applied Mathematics 11, no. 1 (2018): 189. http://dx.doi.org/10.29020/nybg.ejpam.v11i1.2911.

Full text
Abstract:
The aim of this paper is to introduce an implicit S-iteration processand study its convergence in the framework of W-hyperbolic spaces. We showthat the implicit S-iteration process has higher rate of convergence than implicit Mann type iteration and implicit Ishikawa-type iteration processes. We present a numerical example to support the analytic result proved herein. Finally, we prove a data dependence result for a contractive type mapping using implicit S-iteration process.
APA, Harvard, Vancouver, ISO, and other styles
8

Agwu, Imo Kalu, Umar Ishtiaq, Naeem Saleem, Donatus Ikechi Igbokwe, and Fahd Jarad. "Equivalence of novel IH-implicit fixed point algorithms for a general class of contractive maps." AIMS Mathematics 8, no. 1 (2022): 841–72. http://dx.doi.org/10.3934/math.2023041.

Full text
Abstract:
<abstract><p>In this paper, a novel implicit IH-multistep fixed point algorithm and convergence result for a general class of contractive maps is introduced without any imposition of the "sum conditions" on the countably finite family of the iteration parameters. Furthermore, it is shown that the convergence of the proposed iteration scheme is equivalent to some other implicit IH-type iterative schemes (e.g., implicit IH-Noor, implicit IH-Ishikawa and implicit IH-Mann) for the same class of maps. Also, some numerical examples are given to illustrate that the equivalence is true. Ou
APA, Harvard, Vancouver, ISO, and other styles
9

Balicki, Linus. "Low-Rank Alternating Direction Implicit Iteration in pyMOR." GAMM Archive for Students 2, no. 1 (2020): 1–13. http://dx.doi.org/10.14464/gammas.v2i1.420.

Full text
Abstract:
The low-rank alternating direction implicit (LR-ADI) iteration is an effective method for solving large-scale Lyapunov equations. In the software library pyMOR, solutions to Lyapunov equations play an important role when reducing a model using the balanced truncation method. In this article we introduce the LR-ADI iteration as well as pyMOR, while focusing on its features which are relevant for integrating the iteration into the library. We compare the run time of the iteration's pure pyMOR implementation with those achieved by external libraries available within the pyMOR framework.
APA, Harvard, Vancouver, ISO, and other styles
10

Li, Teng-fei, and Heng-you Lan. "On New Picard-Mann Iterative Approximations with Mixed Errors for Implicit Midpoint Rule and Applications." Journal of Function Spaces 2019 (March 3, 2019): 1–13. http://dx.doi.org/10.1155/2019/4042965.

Full text
Abstract:
In order to solve (partial) differential equations, implicit midpoint rules are often employed as a powerful numerical method. The purpose of this paper is to introduce and study a class of new Picard-Mann iteration processes with mixed errors for the implicit midpoint rules, which is different from existing methods in the literature, and to analyze the convergence and stability of the proposed method. Further, some numerical examples and applications to optimal control problems with elliptic boundary value constraints are considered via the new Picard-Mann iterative approximations, which show
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Implicit iteration"

1

Toulis, Panagiotis. "Implicit methods for iterative estimation with large data sets." Thesis, Harvard University, 2016. http://nrs.harvard.edu/urn-3:HUL.InstRepos:33493434.

Full text
Abstract:
The ideal estimation method needs to fulfill three requirements: (i) efficient computation, (ii) statistical efficiency, and (iii) numerical stability. The classical stochastic approximation of (Robbins, 1951) is an iterative estimation method, where the current iterate (parameter estimate) is updated according to some discrepancy between what is observed and what is expected assuming the current iterate has the true parameter value. Classical stochastic approximation undoubtedly meets the computation requirement, which explains its widespread popularity, for example, in modern applications of
APA, Harvard, Vancouver, ISO, and other styles
2

Cai, Shang-Gui. "Computational fluid-structure interaction with the moving immersed boundary method." Thesis, Compiègne, 2016. http://www.theses.fr/2016COMP2276/document.

Full text
Abstract:
Dans cette thèse, une nouvelle méthode de frontières immergées a été développée pour la simulation d'interaction fluide-structure, appelée la méthode de frontières immergées mobiles (en langage anglo-saxon: MIBM). L'objectif principal de cette nouvelle méthode est de déplacer arbitrairement les solides à géométrie complexe dans un fluide visqueux incompressible, sans remailler le domaine fluide. Cette nouvelle méthode a l'avantage d'imposer la condition de non-glissement à l'interface d'une manière exacte via une force sans introduire des constantes artificielles modélisant la structure rigide
APA, Harvard, Vancouver, ISO, and other styles
3

Ahmed, Nisar. "Implicit restart schemes for Krylov subspace model reduction methods." Thesis, Imperial College London, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.340535.

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

Swarup, A. Sri Sakti. "Implicit Least Squares Kinetic Upwind Method (LSKUM) And Implicit LSKUM Based On Entropy Variables (q-LSKUM)." Thesis, Indian Institute of Science, 2000. https://etd.iisc.ac.in/handle/2005/239.

Full text
Abstract:
With increasing demand for computational solutions of fluid dynamical problems, researchers around the world are working on the development of highly robust numerical schemes capable of solving flow problems around complex geometries arising in Aerospace engineering. Also considerable time and effort are devoted to development of convergence acceleration devices, for reducing the computational time required for such numerical solutions. Reduction in run times is very vital for production codes which are used many times in design cycle. In this present work, we consider a numerical scheme calle
APA, Harvard, Vancouver, ISO, and other styles
5

Swarup, A. Sri Sakti. "Implicit Least Squares Kinetic Upwind Method (LSKUM) And Implicit LSKUM Based On Entropy Variables (q-LSKUM)." Thesis, Indian Institute of Science, 2000. http://hdl.handle.net/2005/239.

Full text
Abstract:
With increasing demand for computational solutions of fluid dynamical problems, researchers around the world are working on the development of highly robust numerical schemes capable of solving flow problems around complex geometries arising in Aerospace engineering. Also considerable time and effort are devoted to development of convergence acceleration devices, for reducing the computational time required for such numerical solutions. Reduction in run times is very vital for production codes which are used many times in design cycle. In this present work, we consider a numerical scheme calle
APA, Harvard, Vancouver, ISO, and other styles
6

Le, Chuiton Frédéric. "Une méthode implicite non-factorisée décentrée hybride pour la simulation numérique d'écoulements autour de géométries complexes." Ecully, Ecole centrale de Lyon, 1999. http://bibli.ec-lyon.fr/exl-doc/TH_T1781_flechuiton.pdf.

Full text
Abstract:
Ce mémoire de thèse est consacré à l'étude d'un schéma numérique permettant, à terme, d'effectuer des calculs Navier-Stokes précis à l'aide d'une intégration Euler implicite non-factorisée. La discrétisation en espace est celle d'un schéma décentré hybride (HUS), d'après les travaux de Coquel & Liou, qui conjugue le schéma de Perthame (FVS), fondé sur une interprétation cinétique des équations d'Euler, et le schéma de Osher (FDS). Le schéma ainsi bati préserve la robustesse des FVS, au travers des ondes non-linéaires, et la précision des FDS, pour la capture des ondes linéaires. L'opérateu
APA, Harvard, Vancouver, ISO, and other styles
7

Bílý, Vojtěch. "Detekce a sledování objektů pomocí význačných bodů." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2012. http://www.nusl.cz/ntk/nusl-236598.

Full text
Abstract:
This paper deals with object detection and tracking using iterest points. Existing approaches are described here. Inovated method based on Generalized Hough transform and iterative Hough-space searching is  proposed in this paper. Generality of proposed detector is shown in various types of objects. Object tracking is designed as frame by frame detection.
APA, Harvard, Vancouver, ISO, and other styles
8

Shepherd, David. "Numerical methods for dynamic micromagnetics." Thesis, University of Manchester, 2015. https://www.research.manchester.ac.uk/portal/en/theses/numerical-methods-for-dynamic-micromagnetics(e8c5549b-7cf7-44af-8191-5244a491d690).html.

Full text
Abstract:
Micromagnetics is a continuum mechanics theory of magnetic materials widely used in industry and academia. In this thesis we describe a complete numerical method, with a number of novel components, for the computational solution of dynamic micromagnetic problems by solving the Landau-Lifshitz-Gilbert (LLG) equation. In particular we focus on the use of the implicit midpoint rule (IMR), a time integration scheme which conserves several important properties of the LLG equation. We use the finite element method for spatial discretisation, and use nodal quadrature schemes to retain the conservatio
APA, Harvard, Vancouver, ISO, and other styles
9

Lehoucq, Richard Bruno. "Analysis and implementation of an implicitly restarted Arnoldi iteration." Thesis, 1995. http://hdl.handle.net/1911/16844.

Full text
Abstract:
The Arnoldi algorithm, or iteration, is a computationally attractive technique for computing a few eigenvalues and associated invariant subspace of large, often sparse, matrices. The method is a generalization of the Lanczos process and reduces to that when the underlying matrix is symmetric. This thesis presents an analysis of Sorensen's Implicitly Re-started Arnoldi iteration, (scIRA-iteration), by exploiting its relationship with the scQR algorithm. The goal of this thesis is to present numerical techniques that attempt to make the scIRA-iteration as robust as the implicitly shifted scQR al
APA, Harvard, Vancouver, ISO, and other styles
10

Pollul, Bernhard [Verfasser]. "Iterative solvers in implicit time integration for compressible flows / vorgelegt von Bernhard Pollul." 2008. http://d-nb.info/991566092/34.

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

Books on the topic "Implicit iteration"

1

Saylor, Paul E. Linear iterative solvers for implicit ode methods. National Aeronautics and Space Administration, Langley Research Center, 1990.

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

-S, Liu N., Kim Hyun Dae, and United States. National Aeronautics and Space Administration., eds. An iterative implicit diagonally-dominant factorization algorithm for solving the Navier-Stokes equations. National Aeronautics and Space Administration, 1991.

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

An iterative implicit diagonally-dominant factorization algorithm for solving the Navier-Stokes equations. National Aeronautics and Space Administration, 1991.

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

Lattman, Eaton E., Thomas D. Grant, and Edward H. Snell. Pushing the Envelope. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780199670871.003.0014.

Full text
Abstract:
Direct electron density determination from SAXS data opens up new opportunities. The ability to model density at high resolution and the implicit direct estimation of solvent terms such as the hydration shell may enable high-resolution wide angle scattering data to be used to calculate density when combined with additional structural information. Other diffraction methods that do not measure three-dimensional intensities, such as fiber diffraction, may also be able to take advantage of iterative structure factor retrieval. While the ability to reconstruct electron density ab initio is a major
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Implicit iteration"

1

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

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

Wu, Zi-Niu, and Hui Zou. "Parallel Computation of Compressible Flows for Implicit Schemes Without Sub-iteration and Modification of the Implicit Solver." In Computational Fluid Dynamics for the 21st Century. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/978-3-540-44959-1_13.

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

Li-mei, Liu, Li Xiu-Yun, and Zuo Ya-Li. "Convergence of an Implicit Iteration Process with Errors for ϕ Strictly Pseudocontractive Mappings." In Lecture Notes in Electrical Engineering. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-40630-0_52.

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

Elistratov, Andrei A., Dmitry V. Savin, and Olga B. Isaeva. "Complex Dynamics of the Implicit Maps Derived from Iteration of Newton and Euler Methods." In Communications in Computer and Information Science. Springer Nature Switzerland, 2022. http://dx.doi.org/10.1007/978-3-031-24145-1_3.

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

Qin, Junwei, and Yunzhao Li. "Three-Dimensional Pin-by-Pin Transient Analysis for PWR-Core." In Springer Proceedings in Physics. Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-99-1023-6_67.

Full text
Abstract:
AbstractTo ensure the safety of PWR-core operation, three-dimensional whole-core transient analysis needs to be carried out for the sake of the pin-power distribution. For this purpose, this paper presents “Bamboo-Transient 2.0”, a three-dimensional pin-by-pin transient analysis program. The program adopts a fully-implicit backward method with finite difference for time variable discretization, a method of exponential function expansion nodal (EFEN) SP3 for the neutron transport calculation, and a multi-channel model for the thermal feedback calculation. In addition, Picard iteration is used t
APA, Harvard, Vancouver, ISO, and other styles
6

Xiaomin, Chen, Xie Xuping, and Duan Qibin. "Approximation of Implicit Iteration Process for Common Fixed Point of Composite General Asymptotically Nonexpansive Mappings." In Proceedings of the 2012 International Conference on Communication, Electronics and Automation Engineering. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-31698-2_98.

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

Varga, Richard S. "Alternating-Direction Implicit Iterative Methods." In Matrix Iterative Analysis. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-05156-2_7.

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

Koepf, Wolfram. "Implizite Funktionen und Iteration." In Höhere Analysis mit DERIVE. Vieweg+Teubner Verlag, 1994. http://dx.doi.org/10.1007/978-3-322-83118-7_3.

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

Sima, Vasile, and Pascal Gahinet. "Alternating Implicit and Semi-implicit Iterations in the Periodic QZ Algorithm." In Informatics in Control, Automation and Robotics. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-92442-3_4.

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

Sawitzki, Daniel. "Implicit Flow Maximization by Iterative Squaring." In SOFSEM 2004: Theory and Practice of Computer Science. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24618-3_26.

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

Conference papers on the topic "Implicit iteration"

1

Zhang, Yuxuan, Dingxi Wang, Sen Zhang, and Yuze Zhu. "Numerical Stability Analysis of Implicit Solution Methods for Harmonic Balance Equations." In ASME Turbo Expo 2024: Turbomachinery Technical Conference and Exposition. American Society of Mechanical Engineers, 2024. http://dx.doi.org/10.1115/gt2024-125758.

Full text
Abstract:
Abstract This paper presents an investigation into the numerical stability of various implicit solution methods for an efficient solution of harmonic balance equations for turbomachinery unsteady flows. Those implicit solution methods were proposed to enhance stability and accelerate the convergence of harmonic balance solutions by implicitly integrating the time spectral source term of a harmonic balance equation. They include the block Jacobi method (BJ), the Jacobi iteration method (JI), and their variants, i.e. the modified block Jacobi method (MBJ) and the modified Jacobi iteration method
APA, Harvard, Vancouver, ISO, and other styles
2

Rajaomazava, Tolotra Emerry, Mustapha Benaouicha, and Jacques-Andre´ Astolfi. "A Comparison Study of Coupling Algorithms for Fluid-Structure Interaction Problems." In ASME 2011 Pressure Vessels and Piping Conference. ASMEDC, 2011. http://dx.doi.org/10.1115/pvp2011-57573.

Full text
Abstract:
The influence of numerical schemes for solving coupled problem in fluid-structure interaction is addressed. A non-linear Burgers equation in a bounded domain with moving interface is solved by finite element method (FEM). The implicit and explicit coupling algorithms are studied with interface equation solved at outside then inside of Newton iterative procedure (referred to as implicit-outer, implicit-inner, explicit and semi-implicit schemes respectively). Iteration numbers and computing time are compared for each algorithm. The interface position and energy conservation condition at the inte
APA, Harvard, Vancouver, ISO, and other styles
3

Hu, Yujing, Yingfeng Chen, Changjie Fan, and Jianye Hao. "Explicitly Coordinated Policy Iteration." In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/51.

Full text
Abstract:
Coordination on an optimal policy between independent learners in fully cooperative stochastic games is difficult due to problems such as relative overgeneralization and miscoordination. Most state-of-the-art algorithms apply fusion heuristics on agents' optimistic and average rewards, by which coordination between agents can be achieved implicitly. However, such implicit coordination faces practical issues such as tedious parameter-tuning in real world applications. The lack of an explicit coordination mechanism may also lead to a low likelihood of coordination in problems with multiple optim
APA, Harvard, Vancouver, ISO, and other styles
4

Liu, Chao, and Chun-song Gao. "Joint Iteration Method of unloaded Cable Shape and Pre-displacement of Main Cable Saddle for Long-span Suspension Bridges." In IABSE Symposium, Istanbul 2023: Long Span Bridges. International Association for Bridge and Structural Engineering (IABSE), 2023. http://dx.doi.org/10.2749/istanbul.2023.0904.

Full text
Abstract:
<p>In this paper, a new method for calculating the unloaded cable shape and main cable saddle pre-displacement in the construction of long-span suspension bridges is proposed, which is called the joint iterative method (JIM). In this method, the first iteration does not require presupposing the saddle pre-displacement, and the results of the unloaded cable shape obtained in each subsequent iteration cycle will be mined to guide the saddle pre-displacement correction in the next iteration. This method uses simplified cable models and convergence conditions different from classical methods
APA, Harvard, Vancouver, ISO, and other styles
5

Maddulapalli, K., S. Azarm, and A. Boyars. "Interactive Product Design Selection With an Implicit Value Function." In ASME 2002 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2002. http://dx.doi.org/10.1115/detc2002/dac-34080.

Full text
Abstract:
We present an automated method to aid a Decision Maker (DM) in selecting the ‘most preferred’ from a set of design alternatives. The method assumes that the DM’s preferences reflect an implicit value function that is quasi-concave. The method is iterative, using three approaches in sequence to eliminate lower-value alternatives at each trial design. The method is interactive, with the DM stating preferences in the form of attribute tradeoffs at each trial design. We present an approach for finding a new trial design at each iteration. We provide an example, the design selection for a cordless
APA, Harvard, Vancouver, ISO, and other styles
6

Shim, P. Y., and S. Mannoochehri. "A Hybrid Shape Optimization Method Based on Implicit Differentiation and Node Removal Techniques." In ASME 1993 Design Technical Conferences. American Society of Mechanical Engineers, 1993. http://dx.doi.org/10.1115/detc1993-0434.

Full text
Abstract:
Abstract This paper presents a hybrid shape optimal design methodology using an implicit differentiation approach for sensitivity analysis and a node removal technique for shape alteration. The approach presented attempts to overcome the weaknesses inherent in each individual technique. The basic idea is to combine the sensitivity analysis, which forms the analytical basis for the algorithm, and a node removal technique, which grossly modifies the shape without the need for a remeshing after each iteration. The sensitivity analysis is based on the finite element equilibrium equation and the im
APA, Harvard, Vancouver, ISO, and other styles
7

Yi, Sung-Jae, and Moon-Sun Chung. "An Advanced Semi-Implicit Method for Two-Phase Flow Calculation." In 2010 14th International Heat Transfer Conference. ASMEDC, 2010. http://dx.doi.org/10.1115/ihtc14-22009.

Full text
Abstract:
Introducing the interfacial pressure jump terms based on the surface tension into the momentum equations of two-phase two-fluid model, the system of governing equations is turned mathematically into the hyperbolic system. The eigenvalues of the equation system become always real representing the void wave and the pressure wave propagation speeds as shown in the present authors’ reference: Numerical Heat Transfer —Part B, vol. 40, pp. 83–97. To solve the interfacial pressure jump terms with void fraction gradients implicitly, the conventional semi-implicit method should be modified as an interm
APA, Harvard, Vancouver, ISO, and other styles
8

Shen, Yiqing, Baoyuan Wang, and Gecheng Zha. "Comparison Study of Implicit Gauss-Seidel Line Iteration Method for Transonic Flows." In 18th AIAA Computational Fluid Dynamics Conference. American Institute of Aeronautics and Astronautics, 2007. http://dx.doi.org/10.2514/6.2007-4332.

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

Mosqueda, Gilberto, and Mehdi Ahmadizadeh. "Implicit numerical integration in hybrid simulation with iteration strategy for experimental substructures." In 2009 American Control Conference. IEEE, 2009. http://dx.doi.org/10.1109/acc.2009.5160412.

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

Geng, Zhang. "An Optimization Approach to the Shift Selection Problem in Alternating Direction Implicit Iteration." In 2010 Second International Conference on Computer Modeling and Simulation (ICCMS). IEEE, 2010. http://dx.doi.org/10.1109/iccms.2010.216.

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

Reports on the topic "Implicit iteration"

1

Lehoucq, R. B., and Danny C. Sorensen. Deflation Techniques for an Implicitly Re-started Arnoldi Iteration. Defense Technical Information Center, 1995. http://dx.doi.org/10.21236/ada447560.

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

Alan B. Williams, Benjamin A. Allan, Kyran D. Mish, and Robert L. Clay. ISIS++Reference Guide (Iterative Scalable Implicit Solver in C++) Version 1.1. Office of Scientific and Technical Information (OSTI), 1999. http://dx.doi.org/10.2172/8238.

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

de Kemp, E. A., H. A. J. Russell, B. Brodaric, et al. Initiating transformative geoscience practice at the Geological Survey of Canada: Canada in 3D. Natural Resources Canada/CMSS/Information Management, 2022. http://dx.doi.org/10.4095/331097.

Full text
Abstract:
Application of 3D technologies to the wide range of Geosciences knowledge domains is well underway. These have been operationalized in workflows of the hydrocarbon sector for a half-century, and now in mining for over two decades. In Geosciences, algorithms, structured workflows and data integration strategies can support compelling Earth models, however challenges remain to meet the standards of geological plausibility required for most geoscientific studies. There is also missing links in the institutional information infrastructure supporting operational multi-scale 3D data and model develo
APA, Harvard, Vancouver, ISO, and other styles
4

de Kemp, E. A., H. A. J. Russell, B. Brodaric, et al. Initiating transformative geoscience practice at the Geological Survey of Canada: Canada in 3D. Natural Resources Canada/CMSS/Information Management, 2023. http://dx.doi.org/10.4095/331871.

Full text
Abstract:
Application of 3D technologies to the wide range of Geosciences knowledge domains is well underway. These have been operationalized in workflows of the hydrocarbon sector for a half-century, and now in mining for over two decades. In Geosciences, algorithms, structured workflows and data integration strategies can support compelling Earth models, however challenges remain to meet the standards of geological plausibility required for most geoscientific studies. There is also missing links in the institutional information infrastructure supporting operational multi-scale 3D data and model develo
APA, Harvard, Vancouver, ISO, and other styles
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!