نتایج جستجو برای: full newton steps

تعداد نتایج: 439527  

Journal: :Computational methods in applied mathematics 2022

Abstract We consider the numerical solution of elliptic problems in 3D with boundary nonlinearity, such as arising stationary heat conduction models. allow general non-orthotropic materials where matrix conductivities is a nondiagonal full matrix. The approach involves finite element method (FEM) and Newton type iterations. develop quasi-Newton for this problem, using spectral equivalence to ap...

2013
S. Suppiah

Wireless networks are growing rapidly. TCP is the most widely-used protocol on Internet and so optimizing TCP performance is very important for fast efficient data transfer. The different existing TCP variants and solutions they have not been analyzed together to identify the bottlenecks in wireless networks. TCP has a major problem in its congestion control algorithm which does not allow the f...

Journal: :Remote Sensing 2023

The multi-parameter full waveform inversion (FWI) that integrates velocity and density can make use of the kinematic dynamic information measured data to reconstruct underground model. However, it faces problems crosstalk between multiple parameters strong nonlinearity. This research proposes a multi-constrained, FWI framework based on projected quasi-Newton algorithm. introduce types prior geo...

Journal: :Math. Program. 2005
Robert Mifflin Claudia A. Sagastizábal

For convex minimization we introduce an algorithm based on VU-space decomposition. The method uses a bundle subroutine to generate a sequence of approximate proximal points. When a primal-dual track leading to a solution and zero subgradient pair exists, these points approximate the primal track points and give the algorithm’s V, or corrector, steps. The subroutine also approximates dual track ...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه رازی - دانشکده علوم 1390

حل معادلات غیر خطی خیلی بزرگ در پروژه های دولتی و مسائل فنی مهندسی بسیار مهم است. در این گونه مسائل، تعداد مجهولات و معادلات بسیار زیاد است در این صورت روش های تکراری gmres و گرادیان مزدوج و سایر روش های تکراری مفید نخواهند بود، زیرا در این روش ها اکثراً همگرایی بعد از n تکرار تضمین می شود ( n اندازه ماتریس تکرار است). پس استفاده از این روش ها برای حل چنین مسائل بزرگی به صرفه نیست. در این پایان...

Journal: :SIAM J. Numerical Analysis 2008
Kristian Debrabant Anne Kværnø

In recent years, implicit stochastic Runge–Kutta (SRK) methods have been developed both for strong and weak approximations. For these methods, the stage values are only given implicitly. However, in practice these implicit equations are solved by iterative schemes such as simple iteration, modified Newton iteration or full Newton iteration. We employ a unifying approach for the construction of ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید