[PDF] Top 20 Um estudo sobre o uso de recursos computacionais para o ensino de fun??es

... This is the oldest method if we want to find out the root of ( ) = 0 and it is approximately similar to the bisection method. It is also called a method of chords or a method of linear interpolation. In this case, ... See full document

... we study the non-stationary parallel multisplitting two-stage iterative methods with self- adaptive weighting matrices for solving a linear system whose coefficient matrix is ... See full document

... of iterative methods for solving non-linear equations and prove that the order of convergence of these methods is at least ...new methods require two evaluations of ... See full document

... as one of solving a large number of linear equations, subject to side constraints, such as the non-negativity of the pixel ...to iterative algorithms for solving large ... See full document

... of solving nonlinear equations. The work outlined four methods of solving nonlinear ...Unlike linear equations, most nonlinear equations cannot be solved in finite number ... See full document

... of iterative equations are expressed in the vector-matrix notation To discuss the convergence of the iterative methods (ii) ....we study the behavior of the difference between the exact ... See full document

... classical iterative method, serial or parallel, such as for example, conjugate gradient, preconditioned conjugate gradient, Broyden or ...of solving a linear system of equations is transformed ... See full document

... simplest iterative method for solving Ax = b is ...of iterative methods; bad, because it is not typically used in practice (although its potential usefulness has been reconsidered with the ... See full document

... Theorem 4.1. Let C be a nonempty closed convex subset of a Hilbert space H. Let F be a bifunction of C × C into R which satisfies (A1)–(A4); let S be a nonexpansive mapping of C into H such that F FS∩ EPF ∩ VIC, B / ∅. ... See full document

... new iterative methods of order four and five by using modified homotopy perturbation ...iterative methods. To assess the validity and performance of these iterative methods, we ... See full document

... To show the efficiency of the proposed numerical method, we implement it on some Volterra inte- gral equations. For every example we use a ta- ble that shows exact solution, our approximation and absolute ... See full document

... Gauss-Jordan elimination is a modification of Gaussian elimination. Again we are transforming the coefficient matrix into another matrix that is much easier to solve and the system represented by the new augmented matrix ... See full document

... present some examples to illustrate the efficiency of the iterative algorithm, see Table ...Newton iterative method (see [21]-[22]); RWB method proposed by Ren et ... See full document

... In this section we give some physical examples and compare our methods with other some well known methods. Here all the computations have been done by using Mathematica 8. We consider the ... See full document

... in some cases, algorithms 1 and 2 are better than the Newton’s method for solving nonlinear ...in some cases the new methods require less iteration and function evaluation than that of ...new ... See full document

... on linear equations and linear inequalities of one variable was valid and very practical to be used as a medium of learning in ... See full document

... new iterative method to obtain multiple roots of the nonlinear ...requires one evaluations of function and two evaluation of the first deriva- tive of function, and it is free from second ...other ... See full document

... Predictor-Corrector Methods Based on Weight Combination of Quadrature’s for solving Nonlinear Equations, International Journal of Nonlinear Science, ... See full document

... integro-differential equations, our solutions of the variational iteration method and the demonstration are given in ...the linear Volterra fuzzy integro-differential system is ... See full document

... Further we will show that iterative process (1.7) preserves the conditions of process (1.6) for nonzero roots. The following local convergence theorem is valid. Theorem 1.2 Let α ∈ U , α ≠ 0 be a simple root of a ... See full document