Home
last modified time | relevance | path

Searched refs:m_rhs (Results 1 – 25 of 799) sorted by relevance

12345678910>>...32

/dports/math/libmesh/libmesh-1.6.2/contrib/eigen/3.2.9/doc/examples/
H A Dmatrixfree_cg.cpp61 : m_matrix(matrix), m_rhs(rhs) in MatrixReplacement_ProductReturnType()
65 Index cols() const { return m_rhs.cols(); } in cols()
73 y(0) += 2 * m_rhs(0); y(1) += 1 * m_rhs(0); in evalTo()
74 y(0) += 1 * m_rhs(1); y(1) += 2 * m_rhs(1); y(2) += 1 * m_rhs(1); in evalTo()
75 y(1) += 1 * m_rhs(2); y(2) += 2 * m_rhs(2); y(3) += 1 * m_rhs(2); in evalTo()
76 y(2) += 1 * m_rhs(3); y(3) += 2 * m_rhs(3); in evalTo()
81 typename Rhs::Nested m_rhs; member in MatrixReplacement_ProductReturnType
/dports/math/gismo/gismo-21.12.0/src/gsPde/
H A DgsPoissonPde.h47 : gsPde<T>(domain,bc), m_rhs(rhs)
57 : m_compat_dim(domdim), m_rhs(rhs) in gsPoissonPde()
65 : m_compat_dim(domdim), m_rhs(rhs) in gsPoissonPde()
75 m_rhs=new gsConstantFunction<T>(0); in gsPoissonPde()
86 return m_rhs.piece(0).targetDim(); in numRhs()
89 const gsFunction<T> * rhs() const { return &m_rhs.piece(0); } in rhs()
99 os<<"Source function f= "<< m_rhs <<".\n"; in print()
107 return new gsPoissonPde<T>(m_domain.patch(np),bc,m_rhs); in restrictToPatch()
115 gsPiecewiseFunction<T> m_rhs; variable
H A DgsConvDiffRePde.h46 m_diff(diff), m_conv(conv), m_reac(reac), m_rhs(rhs) in gsConvDiffRePde()
57 : m_diff(diff), m_conv(conv), m_reac(reac), m_rhs(rhs) in gsConvDiffRePde()
77 const gsFunction<T>* rhs() const { return m_rhs; } in rhs()
85 if (m_rhs) os << " Source function: " << *m_rhs <<"\n"; in print()
92 const gsFunction<T>* m_rhs; variable
H A DgsEulerBernoulliBeamPde.h32 : gsPde<T>(domain,bc), m_rhs(rhs) in gsEulerBernoulliBeamPde()
41 : gsPde<T>(domain,bc), m_rhs(rhs.clone()) in gsEulerBernoulliBeamPde()
47 : m_rhs(rhs) in gsEulerBernoulliBeamPde()
53 gsFunction<T> * rhs() const { return m_rhs; } in rhs()
64 gsFunction<T> *m_rhs;
H A DgsBiharmonicPde.h60 : gsPde<T>(domain,bc1), m_rhs(rhs), m_boundary_conditions_second(bc2) in gsBiharmonicPde()
74 return m_rhs.piece(0).targetDim(); in numRhs()
77 const gsFunction<T> * rhs() const { return &m_rhs.piece(0); } in rhs()
91 os<<"Source function f= "<< m_rhs.piece(0) <<".\n"; in print()
97 gsPiecewiseFunction<T> m_rhs; variable
/dports/math/octave/octave-6.4.0/libinterp/parse-tree/
H A Dpt-binop.cc63 m_rhs ? m_rhs->dup (scope) : nullptr, in dup()
105 if (m_rhs) in evaluate()
107 octave_value b = m_rhs->evaluate (tw); in evaluate()
121 if (a.is_defined () && m_rhs) in evaluate()
123 octave_value b = m_rhs->evaluate (tw); in evaluate()
177 m_rhs ? m_rhs->dup (scope) : nullptr, in dup()
214 if (m_rhs) in evaluate()
216 octave_value b = m_rhs->evaluate (tw); in evaluate()
H A Dpt-assign.cc47 : tree_expression (l, c), m_lhs (le), m_rhs (re), m_preserve (plhs), in tree_simple_assignment()
56 delete m_rhs; in ~tree_simple_assignment()
70 m_rhs ? m_rhs->dup (scope) : nullptr, in dup()
83 if (m_rhs) in evaluate()
101 octave_value rhs_val = m_rhs->evaluate (tw); in evaluate()
156 : tree_expression (l, c), m_lhs (lst), m_rhs (r), m_preserve (plhs) in tree_multi_assignment()
164 delete m_rhs; in ~tree_multi_assignment()
185 if (m_rhs) in evaluate_n()
201 const octave_value_list rhs_val1 = m_rhs->evaluate_n (tw, n_out); in evaluate_n()
H A Dpt-assign.h55 : tree_expression (l, c), m_lhs (nullptr), m_rhs (nullptr), in tree_expression()
79 tree_expression * right_hand_side (void) { return m_rhs; } in right_hand_side()
108 tree_expression *m_rhs; variable
127 : tree_expression (l, c), m_lhs (nullptr), m_rhs (nullptr), in tree_expression()
150 tree_expression * right_hand_side (void) { return m_rhs; } in right_hand_side()
179 tree_expression *m_rhs; variable
/dports/graphics/blender/blender-2.91.0/extern/Eigen3/Eigen/src/misc/
H A DSparseSolve.h36 : m_dec(dec), m_rhs(rhs)
40 inline Index cols() const { return m_rhs.cols(); }
42 inline const RhsNestedCleaned& rhs() const { return m_rhs; }
55 int rhsCols = m_rhs.cols();
56 int size = m_rhs.rows();
62 tmp.leftCols(actualCols) = m_rhs.middleCols(k,actualCols);
68 typename Rhs::Nested m_rhs;
106 : m_dec(dec), m_rhs(rhs), m_guess(guess)
110 inline Index cols() const { return m_rhs.cols(); }
115 m_dec._solveWithGuess(m_rhs,dst);
[all …]
/dports/science/apbs/apbs-pdb2pqr-apbs-1.5-102-g500c1473/apbs/include/Eigen/src/misc/
H A DSparseSolve.h36 : m_dec(dec), m_rhs(rhs)
40 inline Index cols() const { return m_rhs.cols(); }
42 inline const RhsNestedCleaned& rhs() const { return m_rhs; }
55 int rhsCols = m_rhs.cols();
56 int size = m_rhs.rows();
62 tmp.leftCols(actualCols) = m_rhs.middleCols(k,actualCols);
68 typename Rhs::Nested m_rhs;
106 : m_dec(dec), m_rhs(rhs), m_guess(guess)
110 inline Index cols() const { return m_rhs.cols(); }
115 m_dec._solveWithGuess(m_rhs,dst);
[all …]
/dports/math/libmesh/libmesh-1.6.2/contrib/eigen/3.2.9/Eigen/src/misc/
H A DSparseSolve.h36 : m_dec(dec), m_rhs(rhs)
40 inline Index cols() const { return m_rhs.cols(); }
42 inline const RhsNestedCleaned& rhs() const { return m_rhs; }
55 int rhsCols = m_rhs.cols();
56 int size = m_rhs.rows();
62 tmp.leftCols(actualCols) = m_rhs.middleCols(k,actualCols);
68 typename Rhs::Nested m_rhs;
106 : m_dec(dec), m_rhs(rhs), m_guess(guess)
110 inline Index cols() const { return m_rhs.cols(); }
115 m_dec._solveWithGuess(m_rhs,dst);
[all …]
/dports/graphics/wdune/wdune-1.926/vcglib/eigenlib/Eigen/src/misc/
H A DSparseSolve.h36 : m_dec(dec), m_rhs(rhs)
40 inline Index cols() const { return m_rhs.cols(); }
42 inline const RhsNestedCleaned& rhs() const { return m_rhs; }
55 int rhsCols = m_rhs.cols();
56 int size = m_rhs.rows();
62 tmp.leftCols(actualCols) = m_rhs.middleCols(k,actualCols);
68 typename Rhs::Nested m_rhs;
106 : m_dec(dec), m_rhs(rhs), m_guess(guess)
110 inline Index cols() const { return m_rhs.cols(); }
115 m_dec._solveWithGuess(m_rhs,dst);
[all …]
/dports/math/tvmet/tvmet-1.7.2/include/tvmet/xpr/
H A DBinOperator.h60 : m_lhs(lhs), m_rhs(rhs) in XprBinOp()
66 : m_lhs(e.m_lhs), m_rhs(e.m_rhs) in XprBinOp()
72 return BinOp::apply_on(m_lhs(i), m_rhs(i)); in operator()
77 return BinOp::apply_on(m_lhs(i, j), m_rhs(i, j)); in operator()
87 m_rhs.print_xpr(os, l);
94 const E2 m_rhs; variable
H A DMVProduct.h71 : m_lhs(lhs), m_rhs(rhs) in XprMVProduct()
77 : m_lhs(e.m_lhs), m_rhs(e.m_rhs) in XprMVProduct()
100 return do_gemv(dispatch<use_meta>(), m_lhs, m_rhs, j); in operator()
113 m_rhs.print_xpr(os, l);
120 const E2 m_rhs; variable
H A DMtVProduct.h71 : m_lhs(lhs), m_rhs(rhs) in XprMtVProduct()
77 : m_lhs(e.m_lhs), m_rhs(e.m_rhs) in XprMtVProduct()
99 return do_gemtv(dispatch<use_meta>(), m_lhs, m_rhs, j); in operator()
110 m_rhs.print_xpr(os, l);
117 const E2 m_rhs; variable
H A DMMProductTransposed.h74 : m_lhs(lhs), m_rhs(rhs) { } in XprMMProductTransposed()
79 : m_lhs(e.m_lhs), m_rhs(e.m_rhs) in XprMMProductTransposed()
102 return do_gemm(dispatch<use_meta>(), m_lhs, m_rhs, j, i); in operator()
115 m_rhs.print_xpr(os, l);
126 const E2 m_rhs; variable
/dports/graphics/appleseed/appleseed-2.1.0-beta/src/appleseed/foundation/meta/benchmarks/
H A Dbenchmark_matrix.cpp42 Matrix<T, 4, 4> m_lhs, m_rhs; in BENCHMARK_SUITE() member
59 m_rhs = transpose(m_lhs); in BENCHMARK_SUITE()
66 m_result_mat = m_lhs * m_rhs; in BENCHMARK_SUITE()
71 m_result_mat = m_lhs * m_rhs; in BENCHMARK_SUITE()
86 m_result_vec = m_vec * m_rhs; in BENCHMARK_SUITE()
91 m_result_vec = m_vec * m_rhs; in BENCHMARK_SUITE()
/dports/math/gismo/gismo-21.12.0/extensions/gsElasticity/
H A DgsBasePde.h37 : gsPde<T>(domain,bc), m_rhs(rhs) in gsBasePde()
39 m_unknownDim.setOnes(m_rhs.targetDim()); in gsBasePde()
48 const gsFunction<T> * rhs() const { return &m_rhs.piece(0); } in rhs()
49 virtual int numUnknowns() const {return m_rhs.targetDim();} in numUnknowns()
53 gsPiecewiseFunction<T> m_rhs; variable
/dports/science/smoldyn/smoldyn-2.67/source/NextSubVolume/Eigen/src/misc/
H A DSparseSolve.h36 : m_dec(dec), m_rhs(rhs)
40 inline Index cols() const { return m_rhs.cols(); }
42 inline const RhsNestedCleaned& rhs() const { return m_rhs; }
51 typename Rhs::Nested m_rhs;
89 : m_dec(dec), m_rhs(rhs), m_guess(guess)
93 inline Index cols() const { return m_rhs.cols(); }
98 m_dec._solveWithGuess(m_rhs,dst);
103 const typename Rhs::Nested m_rhs;
/dports/science/chrono/chrono-7.0.1/src/chrono/solver/
H A DChIterativeSolverLS.cpp217 sysd.ConvertToMatrixForm(nullptr, &m_rhs); in Solve()
226 std::cout << " ||Ax-b|| = " << (Ax - m_rhs).norm() << std::endl; in Solve()
251 m_engine->preconditioner().Setup(m_rhs.size(), m_invdiag); in SetupProblem()
265 m_sol = m_engine->solveWithGuess(m_rhs, m_initguess); in SolveProblem()
267 m_sol = m_engine->solve(m_rhs); in SolveProblem()
296 m_engine->preconditioner().Setup(m_rhs.size(), m_invdiag); in SetupProblem()
310 m_sol = m_engine->solveWithGuess(m_rhs, m_initguess); in SolveProblem()
312 m_sol = m_engine->solve(m_rhs); in SolveProblem()
342 m_engine->preconditioner().Setup(m_rhs.size(), m_invdiag); in SetupProblem()
356 m_sol = m_engine->solveWithGuess(m_rhs, m_initguess); in SolveProblem()
[all …]
/dports/science/apbs/apbs-pdb2pqr-apbs-1.5-102-g500c1473/apbs/include/Eigen/src/Geometry/
H A DHomogeneous.h243 m_rhs(rhs)
247 inline Index cols() const { return m_rhs.cols(); }
255 (m_lhs,0,0,m_lhs.rows(),m_lhs.cols()-1) * m_rhs;
257 .template replicate<MatrixType::ColsAtCompileTime>(m_rhs.cols());
261 typename MatrixType::Nested m_rhs;
282 : m_lhs(lhs), m_rhs(rhs)
286 inline Index cols() const { return m_rhs.cols(); }
294 (m_rhs,0,0,m_rhs.rows()-1,m_rhs.cols());
295 dst += m_rhs.row(m_rhs.rows()-1).colwise()
300 typename Rhs::Nested m_rhs;
/dports/math/libmesh/libmesh-1.6.2/contrib/eigen/3.2.9/Eigen/src/Geometry/
H A DHomogeneous.h243 m_rhs(rhs)
247 inline Index cols() const { return m_rhs.cols(); }
255 (m_lhs,0,0,m_lhs.rows(),m_lhs.cols()-1) * m_rhs;
257 .template replicate<MatrixType::ColsAtCompileTime>(m_rhs.cols());
261 typename MatrixType::Nested m_rhs;
282 : m_lhs(lhs), m_rhs(rhs)
286 inline Index cols() const { return m_rhs.cols(); }
294 (m_rhs,0,0,m_rhs.rows()-1,m_rhs.cols());
295 dst += m_rhs.row(m_rhs.rows()-1).colwise()
300 typename Rhs::Nested m_rhs;
/dports/graphics/wdune/wdune-1.926/vcglib/eigenlib/Eigen/src/Geometry/
H A DHomogeneous.h243 m_rhs(rhs)
247 inline Index cols() const { return m_rhs.cols(); }
255 (m_lhs,0,0,m_lhs.rows(),m_lhs.cols()-1) * m_rhs;
257 .template replicate<MatrixType::ColsAtCompileTime>(m_rhs.cols());
261 typename MatrixType::Nested m_rhs;
282 : m_lhs(lhs), m_rhs(rhs)
286 inline Index cols() const { return m_rhs.cols(); }
294 (m_rhs,0,0,m_rhs.rows()-1,m_rhs.cols());
295 dst += m_rhs.row(m_rhs.rows()-1).colwise()
300 typename Rhs::Nested m_rhs;
/dports/science/smoldyn/smoldyn-2.67/source/NextSubVolume/Eigen/src/Geometry/
H A DHomogeneous.h243 m_rhs(rhs)
247 inline Index cols() const { return m_rhs.cols(); }
255 (m_lhs,0,0,m_lhs.rows(),m_lhs.cols()-1) * m_rhs;
257 .template replicate<MatrixType::ColsAtCompileTime>(m_rhs.cols());
261 typename MatrixType::Nested m_rhs;
282 : m_lhs(lhs), m_rhs(rhs)
286 inline Index cols() const { return m_rhs.cols(); }
294 (m_rhs,0,0,m_rhs.rows()-1,m_rhs.cols());
295 dst += m_rhs.row(m_rhs.rows()-1).colwise()
300 typename Rhs::Nested m_rhs;
/dports/graphics/krita/krita-4.4.8/plugins/extensions/pykrita/plugin/
H A Dversion_checker.h226 m_rhs = rhs; in bind_second()
232 return left < m_rhs; in operator()
234 return left > m_rhs; in operator()
236 return left == m_rhs; in operator()
238 return left != m_rhs; in operator()
240 return left <= m_rhs; in operator()
242 return left >= m_rhs; in operator()
251 return m_rhs; in required()
328 version m_rhs; variable

12345678910>>...32