Relevant bibliographies by topics / Linear equations; Schwarz methods

Contents

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

Academic literature on the topic 'Linear equations; Schwarz methods'

Author: Grafiati
Published: 4 June 2021
Last updated: 8 February 2022

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 'Linear equations; Schwarz methods.'

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 "Linear equations; Schwarz methods"

1

Antonietti, Paola F., Blanca Ayuso de Dios, Susanne C. Brenner, and Li-yeng Sung. "Schwarz Methods for a Preconditioned WOPSIP Method for Elliptic Problems." Computational Methods in Applied Mathematics 12, no. 3 (2012): 241–72. http://dx.doi.org/10.2478/cmam-2012-0021.

Full text
Abstract:
Abstract We propose and analyze several two-level non-overlapping Schwarz methods for a preconditioned weakly over-penalized symmetric interior penalty (WOPSIP) discretization of a second order boundary value problem. We show that the preconditioners are scalable and that the condition number of the resulting preconditioned linear systems of equations is independent of the penalty parameter and is of order H/h, where H and h represent the mesh sizes of the coarse and fine partitions, respectively. Numerical experiments that illustrate the performance of the proposed two-level Schwarz methods are also presented.
APA, Harvard, Vancouver, ISO, and other styles
2

Nagid, Nabila, and Hassan Belhadj. "New approach for accelerating the nonlinear Schwarz iterations." Boletim da Sociedade Paranaense de Matemática 38, no. 4 (March 10, 2019): 51–69. http://dx.doi.org/10.5269/bspm.v38i4.37018.

Full text
Abstract:
The vector Epsilon algorithm is an effective extrapolation method used for accelerating the convergence of vector sequences. In this paper, this method is used to accelerate the convergence of Schwarz iterative methods for stationary linear and nonlinear partial differential equations (PDEs). The vector Epsilon algorithm is applied to the vector sequences produced by additive Schwarz (AS) or restricted additive Schwarz (RAS) methods after discretization. Some convergence analysis is presented, and several test-cases of analytical problems are performed in order to illustrate the interest of such algorithm. The obtained results show that the proposed algorithm yields much faster convergence than the classical Schwarz iterations.
APA, Harvard, Vancouver, ISO, and other styles
3

Antoine, Xavier, Fengji Hou, and Emmanuel Lorin. "Asymptotic estimates of the convergence of classical Schwarz waveform relaxation domain decomposition methods for two-dimensional stationary quantum waves." ESAIM: Mathematical Modelling and Numerical Analysis 52, no. 4 (July 2018): 1569–96. http://dx.doi.org/10.1051/m2an/2017048.

Full text
Abstract:
This paper is devoted to the analysis of convergence of Schwarz Waveform Relaxation (SWR) domain decomposition methods (DDM) for solving the stationary linear and nonlinear Schrödinger equations by the imaginary-time method. Although SWR are extensively used for numerically solving high-dimensional quantum and classical wave equations, the analysis of convergence and of the rate of convergence is still largely open for linear equations with variable coefficients and nonlinear equations. The aim of this paper is to tackle this problem for both the linear and nonlinear Schrödinger equations in the two-dimensional setting. By extending ideas and concepts presented earlier [X. Antoine and E. Lorin, Numer. Math. 137 (2017) 923–958] and by using pseudodifferential calculus, we prove the convergence and determine some approximate rates of convergence of the two-dimensional Classical SWR method for two subdomains with smooth boundary. Some numerical experiments are also proposed to validate the analysis.
APA, Harvard, Vancouver, ISO, and other styles
4

Wu, Shu-Lin. "Schwarz Waveform Relaxation for Heat Equations with Nonlinear Dynamical Boundary Conditions." Abstract and Applied Analysis 2013 (2013): 1–7. http://dx.doi.org/10.1155/2013/474608.

Full text
Abstract:
We are interested in solving heat equations with nonlinear dynamical boundary conditions by using domain decomposition methods. In the classical framework, one first discretizes the time direction and then solves a sequence of state steady problems by the domain decomposition method. In this paper, we consider the heat equations at spacetime continuous level and study a Schwarz waveform relaxation algorithm for parallel computation purpose. We prove the linear convergence of the algorithm on long time intervals and show how the convergence rate depends on the size of overlap and the nonlinearity of the nonlinear boundary functions. Numerical experiments are presented to verify our theoretical conclusions.
APA, Harvard, Vancouver, ISO, and other styles
5

Antoine, X., and E. Lorin. "An analysis of Schwarz waveform relaxation domain decomposition methods for the imaginary-time linear Schrödinger and Gross-Pitaevskii equations." Numerische Mathematik 137, no. 4 (July 8, 2017): 923–58. http://dx.doi.org/10.1007/s00211-017-0897-3.

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

Lapenta, Giovanni, and Wei Jiang. "Implicit Temporal Discretization and Exact Energy Conservation for Particle Methods Applied to the Poisson–Boltzmann Equation." Plasma 1, no. 2 (October 9, 2018): 242–58. http://dx.doi.org/10.3390/plasma1020021.

Full text
Abstract:
We report on a new multiscale method approach for the study of systems with wide separation of short-range forces acting on short time scales and long-range forces acting on much slower scales. We consider the case of the Poisson–Boltzmann equation that describes the long-range forces using the Boltzmann formula (i.e., we assume the medium to be in quasi local thermal equilibrium). We develop a new approach where fields and particle information (mediated by the equations for their moments) are solved self-consistently. The new approach is implicit and numerically stable, providing exact energy conservation. We test different implementations that all lead to exact energy conservation. The new method requires the solution of a large set of non-linear equations. We consider three solution strategies: Jacobian Free Newton Krylov, an alternative, called field hiding which is based on hiding part of the residual calculation and replacing them with direct solutions and a Direct Newton Schwarz solver that considers a simplified, single, particle-based Jacobian. The field hiding strategy proves to be the most efficient approach.
APA, Harvard, Vancouver, ISO, and other styles
7

Гурьева, Я. Л., and В. П. Ильин. "On acceleration technologies of parallel decomposition methods." Numerical Methods and Programming (Vychislitel'nye Metody i Programmirovanie), no. 1 (April 2, 2015): 146–54. http://dx.doi.org/10.26089/nummet.v16r115.

Full text
Abstract:
Одним из главных препятствий масштабированному распараллеливанию алгебраических методов декомпозиции для решения сверхбольших разреженных систем линейных алгебраических уравнений (СЛАУ) является замедление скорости сходимости аддитивного итерационного алгоритма Шварца в подпространствах Крылова при увеличении количества подобластей. Целью настоящей статьи является сравнительный экспериментальный анализ различных приeмов ускорения итераций: параметризованное пересечение подобластей, использование специальных интерфейсных условий на границах смежных подобластей, а также применение грубосеточной коррекции (агрегации, или редукции) исходной СЛАУ для построения дополнительного предобусловливателя. Распараллеливание алгоритмов осуществляется на двух уровнях программными средствами для распределeнной и общей памяти. Тестовые СЛАУ получаются при помощи конечно-разностных аппроксимаций задачи Дирихле для диффузионно-конвективного уравнения с различными значениями конвективных коэффициентов на последовательности сгущающихся сеток. One of the main obstacles to the scalable parallelization of the algebraic decomposition methods for solving large sparse systems of linear algebraic equations consists in slowing the convergence rate of the additive iterative Schwarz algorithm in the Krylov subspaces when the number of subdomains increases. The aim of this paper is a comparative experimental analysis of various ways to accelerate the iterations: a parametrized intersection of subdomains, the usage of interface conditions at the boundaries of adjacent subdomains, and the application of a coarse grid correction (aggregation, or reduction) for the original linear system to build an additional preconditioner. The parallelization of algorithms is performed on two levels by programming tools for the distributed and shared memory. The benchmark linear systems under study are formed using the finite difference approximations of the Dirichlet problem for the diffusion-convection equation with various values of the convection coefficients and on a sequence of condensing grids.
APA, Harvard, Vancouver, ISO, and other styles
8

Zhou, H., and H. A. A. Tchelepi. "Two-Stage Algebraic Multiscale Linear Solver for Highly Heterogeneous Reservoir Models." SPE Journal 17, no. 02 (February 6, 2012): 523–39. http://dx.doi.org/10.2118/141473-pa.

Full text
Abstract:
Summary An efficient Two-Stage Algebraic Multiscale Solver (TAMS) that converges to the fine-scale solution is described. The first (global) stage is a multiscale solution obtained algebraically for the given fine-scale problem. In the second stage, a local preconditioner, such as the Block ILU (BILU), or the Additive Schwarz (AS) method is used. Spectral analysis shows that the multiscale solution step captures the low-frequency parts of the error spectrum quite well, while the local preconditioner represents the high-frequency components accurately. Combining the two stages in an iterative scheme results in efficient treatment of all the error components associated with the fine-scale problem. TAMS is shown to converge to the reference fine-scale solution. Moreover, the eigenvalues of the TAMS iteration matrix show significant clustering, which is favorable for Krylov-based methods. Accurate solution of the nonlinear saturation equations (i.e., transport problem) requires having locally conservative velocity fields. TAMS guarantees local mass conservation by concluding the iterations with a multiscale finite-volume step. We demonstrate the performance of TAMS using several test cases with strong permeability heterogeneity and large-grid aspect ratios. Different choices in the TAMS algorithm are investigated, including the Galerkin and finite-volume restriction operators, as well as the BILU and AS preconditioners for the second stage. TAMS for the elliptic flow problem is comparable to state-of-the-art algebraic multigrid methods, which are in wide use. Moreover, the computational time of TAMS grows nearly linearly with problem size.
APA, Harvard, Vancouver, ISO, and other styles
9

Kong, Fande, and Xiao-Chuan Cai. "Scalability study of an implicit solver for coupled fluid-structure interaction problems on unstructured meshes in 3D." International Journal of High Performance Computing Applications 32, no. 2 (May 4, 2016): 207–19. http://dx.doi.org/10.1177/1094342016646437.

Full text
Abstract:
Fluid-structure interaction (FSI) problems are computationally very challenging. In this paper we consider the monolithic approach for solving the fully coupled FSI problem. Most existing techniques, such as multigrid methods, do not work well for the coupled system since the system consists of elliptic, parabolic and hyperbolic components all together. Other approaches based on direct solvers do not scale to large numbers of processors. In this paper, we introduce a multilevel unstructured mesh Schwarz preconditioned Newton–Krylov method for the implicitly discretized, fully coupled system of partial differential equations consisting of incompressible Navier–Stokes equations for the fluid flows and the linear elasticity equation for the structure. Several meshes are required to make the solution algorithm scalable. This includes a fine mesh to guarantee the solution accuracy, and a few isogeometric coarse meshes to speed up the convergence. Special attention is paid when constructing and partitioning the preconditioning meshes so that the communication cost is minimized when the number of processor cores is large. We show numerically that the proposed algorithm is highly scalable in terms of the number of iterations and the total compute time on a supercomputer with more than 10,000 processor cores for monolithically coupled three-dimensional FSI problems with hundreds of millions of unknowns.
APA, Harvard, Vancouver, ISO, and other styles
10

Phillips, Peter C. B., and Werner Ploberger. "Posterior Odds Testing for a Unit Root with Data-Based Model Selection." Econometric Theory 10, no. 3-4 (August 1994): 774–808. http://dx.doi.org/10.1017/s026646660000877x.

Full text
Abstract:
The Kalman filter is used to derive updating equations for the Bayesian data density in discrete time linear regression models with stochastic regressors. The implied “Bayes model” has time varying parameters and conditionally heterogeneous error variances. A σ-finite Bayes model measure is given and used to produce a new-model-selection criterion (PIC) and objective posterior odds tests for sharp null hypotheses like the presence of a unit root. This extends earlier work by Phillips and Ploberger [18]. Autoregressive-moving average (ARMA) models are considered, and a general test of trend-stationarity versus difference stationarity is developed in ARMA models that allow for automatic order selection of the stochastic regressors and the degree of the deterministic trend. The tests are completely consistent in that both type I and type II errors tend to zero as the sample size tends to infinity. Simulation results and an empirical application are reported. The simulations show that the PIC works very well and is generally superior to the Schwarz BIC criterion, even in stationary systems. Empirical application of our methods to the Nelson-Plosser [11] series show that three series (unemployment, industrial production, and the money stock) are level- or trend-stationary. The other eleven series are found to be stochastically nonstationary.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Linear equations; Schwarz methods"

1

Terkhova, Karina. "Capacitance matrix preconditioning." Thesis, University of Oxford, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.244593.

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

Garay, Jose. "Asynchronous Optimized Schwarz Methods for Partial Differential Equations in Rectangular Domains." Diss., Temple University Libraries, 2018. http://cdm16002.contentdm.oclc.org/cdm/ref/collection/p245801coll10/id/510451.

Full text
Abstract:
Mathematics
Ph.D.
Asynchronous iterative algorithms are parallel iterative algorithms in which communications and iterations are not synchronized among processors. Thus, as soon as a processing unit finishes its own calculations, it starts the next cycle with the latest data received during a previous cycle, without waiting for any other processing unit to complete its own calculation. These algorithms increase the number of updates in some processors (as compared to the synchronous case) but suppress most idle times. This usually results in a reduction of the (execution) time to achieve convergence. Optimized Schwarz methods (OSM) are domain decomposition methods in which the transmission conditions between subdomains contain operators of the form \linebreak $\partial/\partial \nu +\Lambda$, where $\partial/\partial \nu$ is the outward normal derivative and $\Lambda$ is an optimized local approximation of the global Steklov-Poincar\'e operator. There is more than one family of transmission conditions that can be used for a given partial differential equation (e.g., the $OO0$ and $OO2$ families), each of these families containing a particular approximation of the Steklov-Poincar\'e operator. These transmission conditions have some parameters that are tuned to obtain a fast convergence rate. Optimized Schwarz methods are fast in terms of iteration count and can be implemented asynchronously. In this thesis we analyze the convergence behavior of the synchronous and asynchronous implementation of OSM applied to solve partial differential equations with a shifted Laplacian operator in bounded rectangular domains. We analyze two cases. In the first case we have a shift that can be either positive, negative or zero, a one-way domain decomposition and transmission conditions of the $OO2$ family. In the second case we have Poisson's equation, a domain decomposition with cross-points and $OO0$ transmission conditions. In both cases we reformulate the equations defining the problem into a fixed point iteration that is suitable for our analysis, then derive convergence proofs and analyze how the convergence rate varies with the number of subdomains, the amount of overlap, and the values of the parameters introduced in the transmission conditions. Additionally, we find the optimal values of the parameters and present some numerical experiments for the second case illustrating our theoretical results. To our knowledge this is the first time that a convergence analysis of optimized Schwarz is presented for bounded subdomains with multiple subdomains and arbitrary overlap. The analysis presented in this thesis also applies to problems with more general domains which can be decomposed as a union of rectangles.
Temple University--Theses
APA, Harvard, Vancouver, ISO, and other styles
3

Tang, Wei-pai. "Schwarz splitting and template operators." Stanford, CA : Dept. of Computer Science, Stanford University, 1987. http://doi.library.cmu.edu/10.1184/OCLC/19643650.

Full text
Abstract:
Thesis (Ph. D.)--Stanford University, 1987.
"June 1987." "Also numbered Classic-87-03"--Cover. "This research was supported by NASA Ames Consortium Agreement NASA NCA2-150 and Office of Naval Research Contracts N00014-86-K-0565, N00014-82-K-0335, N00014-75-C-1132"--P. vi. Includes bibliographical references (p. 125-129).
APA, Harvard, Vancouver, ISO, and other styles
4

Smith, James A. "“Looking for nothing" : Bayes linear methods for solving equations." Thesis, Durham University, 1993. http://etheses.dur.ac.uk/2207/.

Full text
Abstract:
Here I will describe and implement Bayes linear methods for finding zeros of deterministic functions. We assume that the zero is known to be unique. Initially, the value of the function is modelled simply as the product of two independent factors, the position of the point from the zero and a "slope" which is assumed to vary "smoothly” with position. Additional prior information specifies first and second order properties of the slopes and the position of the zero: in particular, smoothness is specified by modelling the slope process to be stationary with a decreasing correlation function. This research is motivated by problems arising in large scale computer simulation of mathematical models of complex physical phenomena, where a single run of the code can be expensive and the output difficult to assimilate. Scientists are often confident about the structure of their model as a description of a physical process but may be uncertain about the values of certain model "parameters". Such parameters usually refer directly to physical attributes, and so collateral information about their values is usually available. In some applications, the physical process itself has been observed, and several runs of the code are made at different parameter settings in an attempt to match the realisation of the code with the actual realisation. The eventual aim is to aid scientists to search through the "parameter space” efficiently and systematically, using their knowledge of the process. Obviously, there are several respects in which this formulation does not tackle the real problem, as we mainly consider a single-valued function of a real variable. As well as considering this problem I will review the current state of play in the more general field of statistical numerical analysis and its relationship to deterministic computer experiments; and partial belief specification or Bayes linear methods
APA, Harvard, Vancouver, ISO, and other styles
5

Elmikkawy, M. E. A. "Embedded Runge-Kutta-Nystrom methods." Thesis, Teesside University, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.371400.

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

Saravi, Masoud. "Numerical solution of linear ordinary differential equations and differential-algebraic equations by spectral methods." Thesis, Open University, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.446280.

Full text
Abstract:
This thesis involves the implementation of spectral methods, for numerical solution of linear Ordinary Differential Equations (ODEs) and linear Differential-Algebraic Equations (DAEs). First we consider ODEs with some ordinary problems, and then, focus on those problems in which the solution function or some coefficient functions have singularities. Then, by expressing weak and strong aspects of spectral methods to solve these kinds of problems, a modified pseudospectral method which is more efficient than other spectral methods is suggested and tested on some examples. We extend the pseudo-spectral method to solve a system of linear ODEs and linear DAEs and compare this method with other methods such as Backward Difference Formulae (BDF), and implicit Runge-Kutta (RK) methods using some numerical examples. Furthermore, by using appropriatec hoice of Gauss-Chebyshev-Radapuo ints, we will show that this method can be used to solve a linear DAE whenever some of coefficient functions have singularities by providing some examples. We also used some problems that have already been considered by some authors by finite difference methods, and compare their results with ours. Finally, we present a short survey of properties and numerical methods for solving DAE problems and then we extend the pseudo-spectral method to solve DAE problems with variable coefficient functions. Our numerical experience shows that spectral and pseudo-spectral methods and their modified versions are very promising for linear ODE and linear DAE problems with solution or coefficient functions having singularities. In section 3.2, a modified method for solving an ODE is introduced which is new work. Furthermore, an extension of this method for solving a DAE or system of ODEs which has been explained in section 4.6 of chapter four is also a new idea and has not been done by anyone previously. In all chapters, wherever we talk about ODE or DAE we mean linear.
APA, Harvard, Vancouver, ISO, and other styles
7

Campos, Frederico Ferreira. "Analysis of conjugate gradients-type methods for solving linear equations." Thesis, University of Oxford, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.282319.

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

Blake, Kenneth William. "Moving mesh methods for non-linear parabolic partial differential equations." Thesis, University of Reading, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.369545.

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

Shank, Stephen David. "Low-rank solution methods for large-scale linear matrix equations." Diss., Temple University Libraries, 2014. http://cdm16002.contentdm.oclc.org/cdm/ref/collection/p245801coll10/id/273331.

Full text
Abstract:
Mathematics
Ph.D.
We consider low-rank solution methods for certain classes of large-scale linear matrix equations. Our aim is to adapt existing low-rank solution methods based on standard, extended and rational Krylov subspaces to solve equations which may viewed as extensions of the classical Lyapunov and Sylvester equations. The first class of matrix equations that we consider are constrained Sylvester equations, which essentially consist of Sylvester's equation along with a constraint on the solution matrix. These therefore constitute a system of matrix equations. The second are generalized Lyapunov equations, which are Lyapunov equations with additional terms. Such equations arise as computational bottlenecks in model order reduction.
Temple University--Theses
APA, Harvard, Vancouver, ISO, and other styles
10

Fischer, Rainer. "Multigrid methods for anisotropic and indefinite structured linear systems of equations." [S.l.] : [s.n.], 2006. http://mediatum2.ub.tum.de/doc/601806/document.pdf.

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

Books on the topic "Linear equations; Schwarz methods"

1

Kythe, Prem K. Computational Methods for Linear Integral Equations. Boston, MA: Birkhäuser Boston, 2002.

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

Kythe, Prem K., and Pratap Puri. Computational Methods for Linear Integral Equations. Boston, MA: Birkhäuser Boston, 2002. http://dx.doi.org/10.1007/978-1-4612-0101-4.

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

Laflin, S. Numerical methods of linear algebra. [London?]: Chartwell-Brat, 1988.

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

Yoshida, Masaaki. Fuchsian differential equations, with special emphasis on the Gauss-Schwarz theory. Wiesbaden: Vieweg, 1987.

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

Greenbaum, Anne. Iterative methods for solving linear systems. Philadelphia, PA: Society for Industrial and Applied Mathematics, 1997.

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

General linear methods for ordinary differential equations. Hoboken, N.Y: Wiley, 2009.

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

Jackiewicz, Zdzisław. General Linear Methods for Ordinary Differential Equations. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2009. http://dx.doi.org/10.1002/9780470522165.

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

Jerri, Abdul J. Linear Difference Equations with Discrete Transform Methods. Boston, MA: Springer US, 1996. http://dx.doi.org/10.1007/978-1-4757-5657-9.

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

Kelley, C. T. Iterative methods for linear and nonlinear equations. Philadelphia: Society for Industrial and Applied Mathematics, 1995.

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

Jerri, Abdul J. Linear difference equations with discrete transform methods. Dordrecht: Kluwer Academic, 1996.

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

Book chapters on the topic "Linear equations; Schwarz methods"

1

Descombes, Stéphane, Victorita Dolean, and Martin J. Gander. "Schwarz Waveform Relaxation Methods for Systems of Semi-Linear Reaction-Diffusion Equations." In Lecture Notes in Computational Science and Engineering, 423–30. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-11304-8_49.

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

Kress, Rainer. "Quadrature Methods." In Linear Integral Equations, 219–40. New York, NY: Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-9593-2_12.

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

Kress, Rainer. "Projection Methods." In Linear Integral Equations, 241–78. New York, NY: Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-9593-2_13.

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

Kress, Rainer. "Quadrature Methods." In Linear Integral Equations, 168–83. Berlin, Heidelberg: Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/978-3-642-97146-4_12.

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

Kress, Rainer. "Projection Methods." In Linear Integral Equations, 184–205. Berlin, Heidelberg: Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/978-3-642-97146-4_13.

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

Kress, Rainer. "Quadrature Methods." In Linear Integral Equations, 197–217. New York, NY: Springer New York, 1999. http://dx.doi.org/10.1007/978-1-4612-0559-3_12.

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

Kress, Rainer. "Projection Methods." In Linear Integral Equations, 218–46. New York, NY: Springer New York, 1999. http://dx.doi.org/10.1007/978-1-4612-0559-3_13.

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

Woodford, C., and C. Phillips. "Linear Equations." In Numerical Methods with Worked Examples: Matlab Edition, 17–45. Dordrecht: Springer Netherlands, 2012. http://dx.doi.org/10.1007/978-94-007-1366-6_2.

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

Kanwal, Ram P. "Integral Transform Methods." In Linear Integral Equations, 219–36. New York, NY: Springer New York, 2012. http://dx.doi.org/10.1007/978-1-4614-6012-1_9.

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

Kanwal, Ram P. "Integral Transform Methods." In Linear Integral Equations, 219–36. Boston, MA: Birkhäuser Boston, 1997. http://dx.doi.org/10.1007/978-1-4612-0765-8_9.

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

Conference papers on the topic "Linear equations; Schwarz methods"

1

Wang, Guangbin, Hao Wen, and Fuping Tan. "Synchronous Multi-splitting and Schwarz Methods for Solving Linear Complementarity Problems." In 2008 International Symposium on Computer Science and Computational Technology. IEEE, 2008. http://dx.doi.org/10.1109/iscsct.2008.145.

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

Svetlichny, George, Piotr Kielanowski, Anatol Odzijewicz, Martin Schlichenmaier, and Theodore Voronov. "Constant modulus solutions of linear and nonlinear Schrödinger equations." In GEOMETRIC METHODS IN PHYSICS. AIP, 2008. http://dx.doi.org/10.1063/1.3043857.

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

Ponting, David Kenneth, and Richard Hammersley. "Solving Linear Equations In Reservoir Simulation Using Multigrid Methods." In SPE Russian Oil and Gas Technical Conference and Exhibition. Society of Petroleum Engineers, 2008. http://dx.doi.org/10.2118/115017-ms.

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

Borawski, Kamil. "Characteristic equations for descriptor linear electrical circuits." In 2017 22nd International Conference on Methods and Models in Automation and Robotics (MMAR). IEEE, 2017. http://dx.doi.org/10.1109/mmar.2017.8046952.

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

Hammersley, R. P., and D. K. Ponting. "Solving Linear Equations In Reservoir Simulation Using Multigrid Methods (Russian)." In SPE Russian Oil and Gas Technical Conference and Exhibition. Society of Petroleum Engineers, 2008. http://dx.doi.org/10.2118/115017-ru.

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

Swanson, Charles D., and Anthony T. Chronopoulos. "Orthogonal s-step methods for nonsymmetric linear systems of equations." In the 6th international conference. New York, New York, USA: ACM Press, 1992. http://dx.doi.org/10.1145/143369.143450.

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

Barkatou, Moulay A. "Symbolic methods for solving systems of linear ordinary differential equations." In the 2010 International Symposium. New York, New York, USA: ACM Press, 2010. http://dx.doi.org/10.1145/1837934.1837940.

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

Lai, Siyan. "GPU-Based Monte Carlo Methods for Solving Linear Algebraic Equations." In The fourth International Conference on Information Science and Cloud Computing. Trieste, Italy: Sissa Medialab, 2016. http://dx.doi.org/10.22323/1.264.0047.

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

Abe, Kuniyoshi, and Kensuke Aihara. "Hybrid BiCR methods with a stabilization strategy for solving linear equations." In PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON NUMERICAL ANALYSIS AND APPLIED MATHEMATICS 2014 (ICNAAM-2014). AIP Publishing LLC, 2015. http://dx.doi.org/10.1063/1.4912917.

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

Zhang, Hong, Adrian Sandu, Zdzisław Jackiewicz, and Angelamaria Cardone. "Construction of highly stable implicit-explicit general linear methods." In The 10th AIMS Conference on Dynamical Systems, Differential Equations and Applications (Madrid, Spain). American Institute of Mathematical Sciences, 2015. http://dx.doi.org/10.3934/proc.2015.0185.

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

Reports on the topic "Linear equations; Schwarz methods"

1

Varga, Richard S. Investigation on Improved Iterative Methods for Solving Sparse Systems of Linear Equations. Fort Belvoir, VA: Defense Technical Information Center, January 1985. http://dx.doi.org/10.21236/ada187046.

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

Varga, Richard S. Investigations on Improved Iterative Methods for Solving Sparse Systems of Linear Equations. Fort Belvoir, VA: Defense Technical Information Center, November 1985. http://dx.doi.org/10.21236/ada166170.

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

Hesthaven, Jan. Parallel High Order Accuracy Methods Applied to Non-Linear Hyperbolic Equations and to Problems in Materials Sciences. Office of Scientific and Technical Information (OSTI), February 2012. http://dx.doi.org/10.2172/1034525.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Linear equations; Schwarz methods' 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