Home
last modified time | relevance | path

Searched refs:refinement (Results 101 – 125 of 4376) sorted by relevance

12345678910>>...176

/dports/math/arpack-ng/arpack-ng-3.8.0/DOCUMENTS/
H A Dstat.doc16 c nitref = total number of it. refinement steps in reorthogonalization
27 c titref = total time spent in iterative refinement phase in SSAITR.
37 c including iterative refinement in SSAITR.
51 c including iterative refinement in SNAITR.
65 c including iterative refinement in CNAITR.
/dports/science/siconos/siconos-4.4.0/externals/numeric_bindings/libs/numeric/bindings/doc/lapack/driver/
H A Diter_gesv.qbk26 factorization within an iterative refinement procedure to produce a
31 The iterative refinement is not going to be a winning strategy if
36 iterative refinement.
38 The iterative refinement process is stopped if
44 refinement process
H A Diter_posv.qbk27 factorization within an iterative refinement procedure to produce a
32 The iterative refinement is not going to be a winning strategy if
37 iterative refinement.
39 The iterative refinement process is stopped if
45 refinement process
/dports/science/elmerfem/elmerfem-release-9.0/ElmerGUI/samples/in2d/
H A Dv2in2d.in2d10 # next the refinement factor
18 # the refinement factor is an optional flag, -ref=factor, default 1
37 # again, the refinement factor is an optional flag, -ref=factor, default 1
H A Dland_dyke.in2d10 # next the refinement factor
18 # the refinement factor is an optional flag, -ref=factor, default 1
37 # again, the refinement factor is an optional flag, -ref=factor, default 1
H A Dnewin2d.in2d10 # next the refinement factor
19 # the refinement factor is an optional flag, -ref=factor, default 1
40 # again, the refinement factor is an optional flag, -ref=factor, default 1
H A Dairfoil_naca_0012.in2d5 # next the refinement factor
13 # the refinement factor is an optional flag, -ref=factor, default 1
92 # again, the refinement factor is an optional flag, -ref=factor, default 1
/dports/math/dune-multidomaingrid/dune-multidomaingrid-cd5679974fe1c91b56e74022e95f01b1d2018c3b/test/
H A Diterateallinterfaces.cc101 int refinement = 5; in main() local
106 std::cerr << std::endl << "Defaulting to refinement level = " << refinement << std::endl; in main()
109 refinement = atoi(argv[1]); in main()
116 hostgrid.globalRefine(refinement); in main()
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/docs/KeywordMetadata/
H A DDUPLICATE-mfpce-allocation_control-greedy1 Blurb:: Sample allocation based on greedy refinement within multifidelity polynomial chaos
5 refinement strategies, spanning regression and projection approaches
8 candidates for refinement. These candidates are competed against each
26 to one uniform refinement of the current expansion order.
H A DDUPLICATE-mfsc-allocation_control-greedy1 Blurb:: Sample allocation based on greedy refinement within multifidelity stochastic collocation
5 Multifidelity stochastic collocation supports greedy refinement
9 candidates for refinement. These candidates are competed against each
27 uniform refinement of the current sparse grid level.
H A DDUPLICATE-max_refinement_iterations1 Blurb:: Maximum number of expansion refinement iterations
5 refinement strategies.
H A DDUPLICATE-local_adaptive1 Blurb::Planned future capability for local pointwise refinement within a generalized sparse grid.
3 Description::Sparse grid interpolation admits approaches for pointwise local refinement within the …
H A Dmethod-richardson_extrap-estimate_order6 the refinement factors, it evaluates three points along the
7 refinement path and uses these results to perform an estimate of
H A DDUPLICATE-decay1 Blurb::Estimate spectral coefficient decay rates to guide dimension-adaptive refinement.
3 …extrapolation. These decay rates are used to guide dimension-adaptive refinement, where slower de…
H A DDUPLICATE-statistics_mode-active1 Blurb:: use statistics for the active expansion within multifidelity refinement
3 Description:: When performing adaptive refinement in multifidelity UQ
/dports/sysutils/dateutils/dateutils-0.4.1/info/
H A Dformat-ddiff.texi55 @section The refinement rule
66 tool will follow, what we call, the refinement rule. That is,
68 @emph{refinement} of another specifier in the format string, then it
81 The refinement alternatives are listed in order of precedence and they
91 Using the refinement rule keeps the format string dead simple, there's
98 The refinement rule ingeniously covers the 99% case but, unlike other
/dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/examples/step-27/doc/
H A Dresults.dox68 alt="Triangulation containing reentrant corners without adaptive refinement."
74 refinement. New cells are placed near the corners."
80 refinement. New cells are placed near the corners."
86 refinement. New cells are placed near the corners."
92 refinement. New cells are placed near the corners."
98 refinement. New cells are placed near the corners."
116 alt="Depiction of local approximation degrees after one refinement."
160 alt="Depiction of the estimated regularity per cell after one refinement."
190 refinement, particularly when we are far away from boundaries.
212 further research on finding good $hp$ refinement criteria. On the other hand,
[all …]
/dports/net/libyang/libyang-1.0.240/tests/conformance/sec9_4_4/
H A Dmod5.yang13 // legal length refinement
20 // illegal length refinement
/dports/math/dune-uggrid/dune-uggrid-bc2d1229420367563410ce9e519f5ff82b45266f/dune/uggrid/gm/
H A Dugio.cc849 refinement->nnewcorners = n; in SetRefinement()
882 refinement->sonref = sonRefined; in SetRefinement()
891 refinement->pe_info = 0; in SetRefinement()
893 refinement->pe_info = 1; in SetRefinement()
904 refinement->pe_info = 1; in SetRefinement()
905 refinement->pes[i] = -1; in SetRefinement()
912 refinement->pe_info = 0; in SetRefinement()
917 refinement->nmoved = 0; in SetRefinement()
922 refinement->orphanid_ex = n = 0; in SetRefinement()
1276 MGIO_REFINEMENT *refinement; in SaveMultiGrid_SPF() local
[all …]
/dports/cad/openroad/OpenROAD-2.0/src/par/src/
H A Dpartitionmgr.tcl54 [-refinement value] \
76 -refinement \
230 if { [info exists keys(-refinement)] } {
231 if { !([string is integer $keys(-refinement)] && \
232 $keys(-refinement) >= 0 && $keys(-refinement) <= 32768) } {
235 par::set_refinement $keys(-refinement)
/dports/graphics/openvkl/openvkl-1.1.0/testing/volume/
H A DmakeAMR.md26 * `numLevels` - the number of refinement levels to create
27 * `blockSize` - the size of blocks (in units of the next finest refinement
35 * `refinementLevels` - the refinement level for each block in the above vector
/dports/science/apbs/apbs-pdb2pqr-apbs-1.5-102-g500c1473/doc/apbs/input/elec/
H A DakeySOLVE.rst13 where ``key`` is a text string that specifies the method used to guide adaptive refinement:
16 Residual-based a *posteriori* refinement.
/dports/audio/audacity/audacity-Audacity-3.1.3/src/
H A DTrackPanel.cpp1280 , mRefinement{ std::move( refinement ) }
1284 Refinement refinement; in Children() local
1288 refinement.emplace_back( y1, in Children()
1292 return { Axis::Y, std::move( refinement ) }; in Children()
1386 HorizontalGroup(Refinement refinement) in HorizontalGroup()
1387 : mRefinement(std::move(refinement)) in HorizontalGroup()
1408 Refinement refinement; in Children() local
1434 refinement.emplace_back( yy, in Children()
1441 refinement.emplace_back( in Children()
1608 Refinement refinement; in Children() local
[all …]
/dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/examples/step-33/
H A Dinput.prm73 subsection refinement
74 set refinement = true # none only other option
76 set shock levels = 1 # how many levels of refinement to allow
/dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/examples/step-68/
H A Dparameters.prm8 set Fluid refinement = 4
15 set Particle insertion refinement = 3

12345678910>>...176