| /dports/math/xlife++/xlifepp-sources-v2.0.1-2018-05-09/src/solvers/ |
| H A D | IterativeSolver.cpp | 36 epsilon_(theDefaultConvergenceThreshold), residue_(1.), preconditioned_(true), in IterativeSolver()
46 epsilon_(eps), residue_(1.), preconditioned_(prec), in IterativeSolver()
128 info("solver_tail", name_,epsilon_, numberOfIterations_, residue_); in printOutput()
130 << std::setprecision(5) << residue_<<eol<<std::flush; in printOutput()
133 warning("solver_notconverge", name_, numberOfIterations_, residue_, epsilon_); in printOutput()
145 << std::setprecision(5) << residue_<<eol<<std::flush; in printIteration()
157 *i_r = residue_; in storeResidue()
191 if (residue_ < epsilon_ ) in printResult()
192 …" converges after " << numberOfIterations_ << " iterations. The residue is: " << residue_ << eol; } in printResult()
194 …OT converge after " << numberOfIterations_ << " iterations. The residue is: " << residue_ << eol; } in printResult()
|
| H A D | BicgStabSolver.hpp | 170 residue_ = r.norm2() / normb; in algorithm()
173 while( (numberOfIterations_ < maxOfIterations_) && (residue_ > epsilon_) ) //main loop in algorithm()
201 residue_= s.norm2() / normb; in algorithm()
202 if (residue_ < epsilon_) // x=x+alpha*p in algorithm()
220 residue_ = r.norm2() / normb; in algorithm()
250 residue_ = r.norm2() / normb; in algorithm()
253 while( (numberOfIterations_ < maxOfIterations_) && (residue_ > epsilon_) ) //main loop in algorithm()
282 residue_= s.norm2() / normb; in algorithm()
283 if (residue_ < epsilon_) // x=x+alpha*phat in algorithm()
302 residue_ = r.norm2() / normb; in algorithm()
|
| H A D | CgSolver.hpp | 157 residue_ = vecR.norm2() / normofB; in algorithm()
163 while( ( numberOfIterations_ < maxOfIterations_ ) && (residue_ > epsilon_ ) ) in algorithm()
174 residue_ = (vecR.norm2() / normofB ); in algorithm()
175 if ( residue_ < epsilon_ ) { break; } // Convergence when residual norm is small enough in algorithm()
203 residue_ = vecR.norm2() / normofB; in algorithm()
214 while ( ( numberOfIterations_ < maxOfIterations_) && (residue_ > epsilon_ ) ) in algorithm()
226 residue_ = vecR.norm2() / normofB; in algorithm()
227 if ( residue_ < epsilon_ ) { break; } // Convergence when residual norm is small enough in algorithm()
|
| H A D | CgsSolver.hpp | 154 residue_ = r.norm2() / normb; in algorithm()
155 if (residue_ < epsilon_) in algorithm()
163 while ( numberOfIterations_ < maxOfIterations_ && residue_ > epsilon_) in algorithm()
183 residue_ = r.norm2() / normb; in algorithm()
209 residue_ = b.norm2() / normb; in algorithm()
210 if ((residue_) < epsilon_) in algorithm()
218 while ( ( numberOfIterations_ < maxOfIterations_ ) && (residue_ > epsilon_ ) ) in algorithm()
240 residue_ = r.norm2() / normb; in algorithm()
|
| H A D | QmrSolver.hpp | 152 residue_ = vecR.norm2(); in algorithm()
158 real_t yNorm1(residue_); in algorithm()
160 real_t zNorm1(residue_); in algorithm()
171 while((numberOfIterations_ < maxOfIterations_) && (residue_ > epsilon_)) in algorithm()
206 residue_ = vecR.norm2() / normofB; in algorithm()
207 if(residue_ < epsilon_) { break; } in algorithm()
240 residue_ = vecR.norm2(); in algorithm()
256 while (residue_/normofB > epsilon_ && numberOfIterations_ < maxOfIterations_) in algorithm()
307 residue_=R0.norm2(); in algorithm()
|
| H A D | GmresSolver.hpp | 181 residue_ = rho / normofB; in algorithm()
183 while( (residue_ > epsilon_) && (numberOfIterations_ < maxOfIterations_) ) in algorithm()
213 residue_ = rho / normofB; in algorithm()
252 residue_ = rho / normofB; in algorithm()
255 while( (residue_ > epsilon_) && (numberOfIterations_ < maxOfIterations_ ) ) in algorithm()
296 residue_ = rho / normofB; in algorithm()
297 if ( residue_ > epsilon_ ) { in algorithm()
303 residue_ = rho / normofB; in algorithm()
|
| H A D | SorSolver.hpp | 115 residue_ = vecR.norm2() / normofB; in algorithm()
118 while ( (residue_ > epsilon_) && (numberOfIterations_ < maxOfIterations_) ) in algorithm()
127 residue_ = vecR.norm2() / normofB; // Convergence when r.norm2() is small enough in algorithm()
|
| H A D | SsorSolver.hpp | 116 residue_ = vecR.norm2() / normofB; in algorithm()
124 while ( (residue_ > epsilon_) && (numberOfIterations_ < maxOfIterations_) ) in algorithm()
136 residue_ = vecR.norm2() / normofB; // Convergence when r1.norm2() is small enough in algorithm()
|
| H A D | IterativeSolver.hpp | 136 {return residue_;} in residue()
174 real_t residue_; member in xlifepp::IterativeSolver
|
| H A D | BicgSolver.hpp | 213 residue_ = std::sqrt(std::abs(gamma)); in algorithm()
278 residue_ = std::sqrt(std::abs(gamma)); in algorithm()
|
| /dports/math/linbox/linbox-1.6.3/linbox/algorithms/ |
| H A D | rational-cra-builder-early-single.h | 55 …fieldreconstruct(this->residue_, D, e, D.init(u0,this->residue_), D.init(m0,this->primeProd_), Int… in progress()
59 _ZZ.reconstructRational(a, b, this->residue_, this->primeProd_); in progress()
71 Integer u0 = this->residue_ %D; in progress()
74 fieldreconstruct(this->residue_, D, e, u0, m0, Integer(this->residue_), this->primeProd_); in progress()
77 _ZZ.reconstructRational(a, b, this->residue_, this->primeProd_); in progress()
91 _ZZ.reconstructRational(Numer0, Denom0, this->residue_, this->primeProd_); in initialize()
97 _ZZ.reconstructRational(Numer0, Denom0, this->residue_, this->primeProd_); in initialize()
|
| H A D | cra-builder-single.h | 88 Integer residue_; // remainder to be reconstructed member
118 Integer u0 = residue_ % D;//0 in progress_check()
134 residue_ += u0; // res <-- u0 + (u1-u0)( m0^{-1} mod m1 ) m0 and res < m0m1 in progress_check()
167 if (! D.areEqual( D.init(u0, residue_), e)) { in progress_check()
189 residue_ += res; // <-- u0 + (e-u0)( m0^{-1} mod nextM_ ) m0 in progress_check()
232 residue_ = e; in initialize()
257 D.convert( residue_, e); in initialize()
270 return d=residue_; in result()
277 return r= residue_; in getResidue()
|
| H A D | cra-builder-var-prec-early-single.h | 284 CRABuilderEarlySingle<Domain>::residue_ = 0; in changePreconditioner()
302 Integer prev_residue_ = CRABuilderEarlySingle<Domain>::residue_; in changePreconditioner()
305 if (prev_residue_ == CRABuilderEarlySingle<Domain>::residue_ ) { in changePreconditioner()
|
| H A D | cra-builder-early-multip.h | 214 CRABuilderEarlySingle<Domain>::residue_ = 0; in changeVector()
227 Integer prev_residue_ = CRABuilderEarlySingle<Domain>::residue_; in changeVector()
229 if (prev_residue_ == CRABuilderEarlySingle<Domain>::residue_ ) in changeVector()
|
| H A D | cra-builder-var-prec-early-multip.h | 459 CRABuilderEarlySingle<Domain>::residue_ = 0; in changePreconditioner()
477 auto prev_residue_ = CRABuilderEarlySingle<Domain>::residue_; in changePreconditioner()
480 if (prev_residue_ == CRABuilderEarlySingle<Domain>::residue_ ) { in changePreconditioner()
|
| /dports/science/votca/votca-2021.2-18560-gfbe18d971/csg/src/libcsg/ |
| H A D | topology.cc | 112 for (const auto &residue_ : top->residues_) { in CopyTopologyData() local
113 CreateResidue(residue_.getName()); in CopyTopologyData()
|
| /dports/science/votca/votca-2021.2-18560-gfbe18d971/csg/csg-da5c1dc/src/libcsg/ |
| H A D | topology.cc | 112 for (const auto &residue_ : top->residues_) { in CopyTopologyData() local
113 CreateResidue(residue_.getName()); in CopyTopologyData()
|