Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “iterative linear solution”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 361 records · Page 20

Overset meshes for incompressible flows: On preserving accuracy of underlying discretizations

This study on overset meshes for incompressible-flow simulations is motivated by accurate prediction of wind farm aerodynamics involving large motions and deformations of components with complex geometry. Specifically, using first-order hyperbolic and elliptic equation proxies for the incompressible Navier-Stokes (NS) equations, we investigate the influence of information exchange between overset meshes on numerical performance where the underlying discretization is second-order accurate. The first aspect of information exchange surrounds interpolation of solution where we examine Lagrange and point-cloud-based interpolation for creating constraint equations between overset meshes. To maintain overall second-order accuracy, higher-order interpolation is required for elliptic problems, but linear interpolation is sufficient for hyperbolic problems in first-order form. Higher-order point-cloud-based interpolation provides a pathway to maintaining accuracy in unstructured meshes, but at higher complexity. The second aspect of information exchange focuses on comparing the approaches of overset single system (OSS) and overset Additive Schwarz (OAS) for coupling the linear systems of the overlapping meshes. While the former involves a single linear system, in the latter the discrete linear systems are solved separately, and solving the global system is accomplished through outer iterations and sequential information exchange in a Jacobi fashion. For the test cases studied, accuracy for hyperbolic problems is maintained by performing two outer iterations, whereas many outer iterations are required for elliptic systems. The order-of-accuracy studies explored here are critical for verifying the overset-mesh coupling algorithms used in engineering simulations. Accuracy of these simulations themselves is, however, quantified using engineering quantities of interest such as drag, power, etc. Consequently, we conclude with numerical experiments using NS equations for incompressible flows where we show that linear interpolation and few outer iterations are sufficient for achieving asymptotic convergence of engineering quantities of interest.

97 MATHEMATICS AND COMPUTING↗

The Challenges of Plasma Material Interactions in Nuclear Fusion Devices and Potential Solutions

Plasma Material Interactions in future fusion reactors have been identified as a knowledge gap to be dealt with before any next step device past ITER can be built. The challenges are manifold. They are related to power dissipation so that the heat fluxes to the plasma facing components can be kept at technologically feasible levels; maximization of the lifetime of divertor plasma facing components that allow for steady-state operation in a reactor to reach the neutron fluences required; the tritium inventory (storage) in the plasma facing components, which can lead to potential safety concerns and reduction in the fuel efficiency; and it is related to the technology of the plasma facing components itself, which should demonstrate structural integrity under the high temperatures and neutron fluence. This contribution will give an overview and summary of those challenges together with some discussion of potential solutions. New linear plasma devices are needed to investigate the PMI under fusion reactor conditions and test novel plasma facing components. The Material Plasma Exposure eXperiment MPEX will be introduced and a status of the current R&D towards MPEX will be summarized.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Randomized Preconditioned Solvers for Strong Constraint 4D-Var Data Assimilation

The Strong Constraint 4D Variational (SC-4DVAR) data assimilation method is widely used in climate and weather applications. SC-4DVAR involves solving a minimization problem to compute the maximum a posteriori estimate, which we tackle using the Gauss-Newton method. The computation of the descent direction is expensive since it involves the solution of a large-scale and potentially ill-conditioned linear system, solved using the preconditioned conjugate gradient (PCG) method. Here, to address this cost, we efficiently construct scalable preconditioners using three different randomization techniques, which all rely on a certain low-rank structure involving the Gauss-Newton Hessian. The proposed techniques come with theoretical guarantees on the condition number, and at the same time, are amenable to parallelization. We also develop an adaptive approach to estimate the sketch size and choose between the reuse or recomputation of the preconditioner. We demonstrate the performance and effectiveness of our methodology on two representative model problems—the Burgers and barotropic vorticity equation—showing a drastic reduction in both the number of PCG iterations and the number of Gauss-Newton Hessian products after including the preconditioner construction cost.

Gauss-Newton↗

Orbital-free density functional theory implementation with the projector augmented-wave method

We present a computational scheme for orbital-free density functional theory (OFDFT) that simultaneously provides access to all-electron values and preserves the OFDFT linear scaling as a function of the system size. Using the projector augmented-wave method (PAW) in combination with real-space methods, we overcome some obstacles faced by other available implementation schemes. Specifically, the advantages of using the PAW method are twofold. First, PAW reproduces all-electron values offering freedom in adjusting the convergence parameters and the atomic setups allow tuning the numerical accuracy per element. Second, PAW can provide a solution to some of the convergence problems exhibited in other OFDFT implementations based on Kohn-Sham (KS) codes. Using PAW and real-space methods, our orbital-free results agree with the reference all-electron values with a mean absolute error of 10 meV and the number of iterations required by the self-consistent cycle is comparable to the KS method. The comparison of all-electron and pseudopotential bulk modulus and lattice constant reveal an enormous difference, demonstrating that in order to assess the performance of OFDFT functionals it is necessary to use implementations that obtain all-electron values. The proposed combination of methods is the most promising route currently available. We finally show that a parametrized kinetic energy functional can give lattice constants and bulk moduli comparable in accuracy to those obtained by the KS PBE method, exemplified with the case of diamond.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Solution Irregularity Remediation for Spatial Discretization Error Estimation for S N Transport Solutions

The discrete ordinates linear Boltzmann transport equation is typically solved in its spatially discretized form, incurring spatial discretization error. Quantification of this error for purposes such as adaptive mesh refinement or error analysis requires an a posteriori estimator, which utilizes the numerical solution to the spatially discretized equation to compute an estimate. Because the quality of the numerical solution informs the error estimate, irregularities, present in the true solution for any realistic problem configuration, tend to cause the largest deviation in the error estimate vis-a-vis the true error. In this paper, an analytical partial singular characteristic tracking (pSCT) procedure for reducing the estimator’s error is implemented within our novel residual source estimator for a zeroth-order discontinuous Galerkin scheme, at the additional cost of a single inner iteration. Here, a metric-based evaluation of the pSCT scheme versus the standard residual source estimator is performed over the parameter range of a Method of Manufactured Solutions test suite. The pSCT scheme generates near-ideal accuracy in the estimate in problems where the dominant source of the estimator’s error is the solution irregularity, namely, problems where the true solution is discontinuous and problems where the true solution’s first derivative is discontinuous and the scattering ratio is low. In problems where the scattering ratio is high and the true solution is discontinuous in the first derivative, the error in the scattering source, which is not converged by the pSCT scheme, is greater than the error incurred due to the irregularity. Ultimately, a pSCT scheme is judged to be useful for error estimation in problems where the computational cost of the scheme is justified. In the presence of many irregularities, such a scheme may be intractable for general use, but in benchmarks, as an analytical tool, or in problems that have nondissipative discontinuities, the scheme may prove invaluable.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

ALESQP: An Augmented Lagrangian Equality-Constrained SQP Method for Optimization with General Constraints

Here we present a new algorithm for infinite-dimensional optimization with general constraints, called ALESQP. In short, ALESQP is an augmented Lagrangian method that penalizes inequality constraints and solves equality-constrained nonlinear optimization subproblems at every iteration. The subproblems are solved using a matrix-free trust-region sequential quadratic programming (SQP) method that takes advantage of iterative, i.e., inexact linear solvers, and is suitable for large-scale applications. A key feature of ALESQP is a constraint decomposition strategy that allows it to exploit problem-specific variable scalings and inner products. We analyze convergence of ALESQP under different assumptions. We show that strong accumulation points are stationary. Consequently, in finite dimensions ALESQP converges to a stationary point. In infinite dimensions we establish that weak accumulation points are feasible in many practical situations. Under additional assumptions we show that weak accumulation points are stationary. We present several infinite-dimensional examples where ALESQP shows remarkable discretization-independent performance in all of its iterative components, requiring a modest number of iterations to meet constraint tolerances at the level of machine precision. Also, we demonstrate a fully matrix-free solution of an infinite-dimensional problem with nonlinear inequality constraints.

97 MATHEMATICS AND COMPUTING↗

Finite difference method for solving the Schroedinger equation with band nonparabolicity in mid-infrared quantum cascade lasers

The nonparabolic Schroedinger equation for electrons in quantum cascade lasers (QCLs) is a cubic eigenvalue problem (EVP) which cannot be solved directly. While a method for linearizing this cubic EVP has been proposed in principle for quantum dots [Hwang et al., Math. Comput. Modell., 40, 519 (2004)] it was deemed too computationally expensive because of the three-dimensional geometry under consideration. We adapt this linearization approach to the one-dimensional geometry of QCLs, and arrive at a direct and exact solution to the cubic EVP. The method is then compared with the well established shooting method, and it is shown to be more accurate and reliable for calculating the bandstructure of mid-infrared QCLs.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Probability of Initiation in Neutron Transport

We discuss the numerical solution of the nonlinear integro-differential equation for the probability of a divergent neutron chain in a stationary system (i.e., the probability of initiation (POI)). We follow the development described in Bell’s classic paper on the stochastic theory of neutron transport. As noted by Bell, the linearized form of this equation resembles the linear adjoint neutron transport equation. A matrix formalism for the discretized steady state (or forward) neutron equation in slab geometry is first developed, and is then used to derive the discrete adjoint equation. A main advantage of this discrete development is that the resulting discrete adjoint equation does not depend upon how the multigroup cross sections for the forward problem are obtained. That is, we derive the discrete adjoint directly from the discrete forward equations rather than discretizing directly the adjoint equation. This also guarantees that the discrete adjoint operator is consistent with the inner product used to define the adjoint operator. We discuss three approaches for the numerical solution of the POI equations, and present numerical results on several test problems. The three solution methods are a simple fixed point iteration, a second approach that is akin to a nonlinear Power iteration, and a third approach which uses a Newton-Krylov nonlinear solver. We also give sufficient conditions to guarantee the existence and uniqueness of nontrivial solutions to our discrete POI equations when the discrete system is supercritical, and that only the trivial solution exists when the discrete system is subcritical. Our approach is modelled after the analysis presented for the continuous POI equations by Mokhtar-Kharroubi and Jarmouni-Idrissi [12], and by Pazy and Rabinowitz [14].

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Fast numerical treatment of nonlinear wave equations by spectral methods

A method is presented that accelerates spectral methods for numerical solution of a broad class of nonlinear partial differential wave equations that are first order in time and that arise in plasma wave theory. The approach involves exact analytical treatment of the linear part of the wave evolution including growth and damping as well as dispersion. After introducing the method for general scalar and vector equations, we discuss and illustrate it in more detail in the context of the coupling of high- and low-frequency plasma wave modes, as modeled by the electrostatic and electromagnetic Zakharov equations in multiple dimensions. For computational efficiency, the method uses eigenvector decomposition, which is particularly advantageous when the wave damping is mode-dependent and anisotropic in wavenumber space. In this context, it is shown that the method can significantly speed up numerical integration relative to standard spectral or finite difference methods by allowing much longer time steps, especially in the limit in which the nonlinear Schroedinger equation applies.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Probability of Initiation in Neutron Transport

We discuss the numerical solution of the nonlinear integro-differential equation for the probability of a divergent neutron chain in a stationary system (i.e., the probability of initiation (POI)). We follow the development described in Bell’s classic paper on the stochastic theory of neutron transport. As noted by Bell, the linearized form of this equation resembles the linear adjoint neutron transport equation. A matrix formalism for the discretized steady state (or forward) neutron equation in slab geometry is first developed and is then used to derive the discrete adjoint equation. A main advantage of this discrete development is that the resulting discrete adjoint equation does not depend upon how the multigroup cross sections for the forward problem are obtained. That is, we derive the discrete adjoint directly from the discrete forward equations rather than discretizing directly the adjoint equation. This also guarantees that the discrete adjoint operator is consistent with the inner product used to define the adjoint operator. We discuss three approaches for the numerical solution of the POI equations, and present numerical results on several test problems. The three solution methods are a simple fixed-point iteration, a second approach that is akin to a nonlinear Power iteration, and a third approach which uses a Newton-Krylov nonlinear solver. We also give sufficient conditions to guarantee the existence and uniqueness of nontrivial solutions to our discrete POI equations when the discrete system is supercritical, and that only the trivial solution exists when the discrete system is subcritical. Our approach is modeled after the analysis presented for the continuous POI equations by Mokhtar-Kharroubi and Jarmouni-Idrissi, and by Pazy and Rabinowitz.

42 ENGINEERING↗

Efficient Scalable Parallel Higher Order Direct MoM-SIE Method With Hierarchically Semiseparable Structures for 3-D Scattering

A novel fast scalable parallel algorithm is proposed for the solution of large 3-D scattering problems based on: 1) the double (geometrical and current-approximation) higher order (DHO) method of moments (MoM) in the surface integral equation (SIE) formulation and 2) a direct solver for dense linear systems utilizing hierarchically semiseparable (HSS) structures. Namely, an HSS matrix representation is used for compression, factorization, and solution of the system matrix. In addition, a rank-revealing QR decomposition for memory compression is used, with a stopping criterion in terms of the relative rank tolerance value. One method for geometrical preprocessing of the scatterers based on the cobblestone distance sorting technique is employed in order to enhance the HSS algorithm accuracy and parallelization. Numerical examples show how the accuracy of the DHO HSS-MoM-SIE method is easily controllable by using the relative tolerance for the matrix compression. Furthermore, the examples demonstrate low memory consumption, as well as much faster simulation time, when compared to the direct LU decomposition. The method enables dramatically faster monostatic scattering computations than iterative solvers and reduced number of unknowns when compared to low-order discretizations. Finally, great scalability of the algorithm is demonstrated on more than one thousand processes.

97 MATHEMATICS AND COMPUTING↗

Impact of K-factor on Short Circuit Program Convergence for Inverter-Based Resources during Faults

Classical short-circuit programs that linearize the power network are no longer applicable for inverter based resources (IBRs), necessitating an iterative approach. Phasor domain programs can model the IBRs using an iterative approach considering nonlinear fault responses. In phasor domain models, the IBR can be modeled as a voltage controlled current source (VCCS) in tabular form with positive, negative, and zero sequence information for balanced and unbalance short-circuit faults. In the VCCS modeling of the IBR, positive and negative incremental reactive current, also known as the k-factor, plays an important role in short circuit program convergence. In this work, a few approaches: conventional VCCS modeling with a k-factor of 2, conventional VCCS modeling with a k-factor of 2 with modified pre-fault voltages, VCCS characteristics based on the power flow solution with a k-factor of 2, and VCCS characteristics based on the power flow solution with a k-factor of 1 are investigated for short circuit program convergence under higher IBR penetration. The IEEE 39 bus New England Test System is taken as the test system, and simulations are carried out in PSS®CAPE 15.0.26 simulation software. Simulation results demonstrate that IBR penetration is higher for the VCCS model, which corresponds to the power flow solution with k-factor 1, compared to other approaches.

42 ENGINEERING↗

Resolving broadening of ECRH deposition due to edge turbulence in DIII-D by heat deposition measurement

Interaction between microwave power, used for local heating and mode control, and density fluctuations can produce a broadening of the injected beam, as confirmed in experiment and simulation. Increased power deposition width could impact suppression of tearing mode structures on ITER[1]. This work discusses the experimental portion of an effort to understand scattering of injected microwaves by turbulence on the DIII-D tokamak. The corresponding theoretical modeling work can be found in M.B. Thomas et. al.: Submitted to Nuclear Fusion (2017)[Author Note - this paper to be published in same journal]. In a set of perturbative heat transport experiments, tokamak edge millimeter-scale fluctuation levels and microwave heat deposition are measured simultaneously. Beam broadening is separated from heat transport through fitting of modulated fluxes[2]. Electron temperature measurements from a 500 kHz, 48-channel ECE radiometer are Fourier analyzed and used to calculate a deposition-dependent flux[3]. Consistency of this flux with a transport model is evaluated. A diffusive(∝ ∇˜ T e ) and convective(∝ ˜ T e ) transport solution is linearized and compared with energy conservation-derived fluxes. Comparison between these two forms of heat flux is used to evaluate the quality of ECRF deposition profiles, and a Χ 2 minimization finds a significant broadening of 1D equilibrium ray tracing calculations from the benchmarked TORAY-GA ray tracing code[4] is needed. The physical basis, cross-validation, and application of the heat flux method is presented. The method is applied to a range of DIII-D discharges and finds a broadening factor of the deposition profile width which scales linearly with edge density fluctuation level. Furthermore, these experimental results are found to be consistent with the full-wave beam broadening measured by the 3D full wave simulations in the same discharges[5].

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

ARC physics basis–magnetohydrodynamics

ARC is designed to produce 400 ⁢MW of net electricity and prove the commercial feasibility of a fusion power plant. In order to achieve this goal ARC has to operate with optimal core performance in a stationary scenario that minimises wear on the first wall and divertor. This requires avoiding or mitigating magnetohydrodynamic (MHD) instabilities which have the potential to not only degrade the plasma core but also lead to deleterious transient heat loads on plasma facing components. Therefore, this work aims at characterising the MHD stability of the high performance ARC scenario and inform the design of error field correction coils. Firstly, simulations of vertical displacement events show that an in-vessel coil is not needed and instead the poloidal shaping coils can be used to control vertical stability. These simulations also inform the demands on the corresponding coil power supplies. Stability analysis of the ideal kink mode with or without a conducting wall and kinetic effects suggests that the ARC baseline scenario operates deeply in the stable region. Using RDCON, tearing modes at the 𝑚/𝑛 =2/1 and 3/2 surfaces (with poloidal mode number 𝑚, and toroidal mode number 𝑛) are shown to be linearly stable, and including thermal transport effects in the rational surfaces lead to further stabilisation. However, other transient plasma instabilities can seed neoclassical tearing modes (NTMs). The marginally stable width of NTMs in ARC strongly depends on the internal inductance and can fall below 0.1% of the normalised poloidal flux. Furthermore, an empirical cross-machine model of the 𝑛 =1 error field leading to a disruption predicts a critical error field larger than SPARC but smaller than ITER. Three-dimensional coils can be designed with the Generalised Purturbed Equilbium Code based on a simple model that calculates the maximum correctable error field that is limited by the neoclassical toroidal viscosity torque. Broad scans of different coil geometries identify a set of 2 rows of off-midplane coils to be a suitable solution. It is also determined that such a set of three-dimensional coils is capable of correcting 𝑛 =2 error fields to some degree and creating strong enough 𝑛 =2 or 𝑛 =3 edge resonant perturbation fields for the suppression of edge-localised modes at reasonable coil currents. The final design of the first ARC will be further informed by results from SPARC.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

An iterative phase-space explicit discontinuous Galerkin method for stellar radiative transfer in extended atmospheres

In this work, a phase-space discontinuous Galerkin (PSDG) method is presented for the solution of stellar radiative transfer problems. It allows for greater adaptivity than competing methods without sacrificing generality. The method is extensively tested on a spherically symmetric, static, inverse-power-law scattering atmosphere. Results for different sizes of atmospheres and intensities of scattering agreed with asymptotic values. The exponentially decaying behavior of the radiative field in the diffusive-transparent transition region, and the forward peaking behavior at the surface of extended atmospheres were accurately captured. The integrodifferential equation of radiation transfer is solved iteratively by alternating between the radiative pressure equation and the original equation with the integral term treated as an energy density source term. In each iteration, the equations are solved via an explicit, flux-conserving, discontinuous Galerkin method. Finite elements are ordered in wave fronts perpendicular to the characteristic curves so that elemental linear algebraic systems are solved quickly by sweeping the phase space element by element. Two implementations of a diffusive boundary condition at the origin are demonstrated wherein the finite discontinuity in the radiation intensity is accurately captured by the proposed method. This allows for a consistent mechanism to preserve photon luminosity. The method was proved to be robust and fast, and a case is made for the adequacy of parallel processing. In addition to classical two-dimensional plots, results of normalized radiation intensity were mapped onto a log-polar surface exhibiting all distinguishing features of the problem studied.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Block-Asynchronous Relaxation Method for Graphics Processing Units

In this paper, we analyze the potential of asynchronous relaxation methods on Graphics Processing Units (GPUs). For this purpose, we developed a set of asynchronous iteration algorithms in CUDA and compared them with a parallel implementation of synchronous relaxation methods on CPU-based systems. For a set of test matrices taken from the University of Florida Matrix Collection we monitor the convergence behavior, the average iteration time and the total time-to-solution time. Analyzing the results, we observe that even for our most basic asynchronous relaxation scheme, despite its lower convergence rate compared to the Gauss-Seidel relaxation (that we expected), the asynchronous iteration running on GPUs is still able to provide solution approximations of certain accuracy in considerably shorter time then Gauss- Seidel running on CPUs. Hence, it overcompensates for the slower convergence by exploiting the scalability and the good fit of the asynchronous schemes for the highly parallel GPU architectures. Further, enhancing the most basic asynchronous approach with hybrid schemes – using multiple iterations within the ”subdomain” handled by a GPU thread block and Jacobi-like asynchronous updates across the ”boundaries”, subject to tuning various parameters – we manage to not only recover the loss of global convergence but often accelerate convergence of up to two times (compared to the effective but difficult to parallelize Gauss-Seidel type of schemes), while keeping the execution time of a global iteration practically the same. This shows the high potential of the asynchronous methods not only as a stand alone numerical solver for linear systems of equations fulfilling certain convergence conditions but more importantly as a smoother in multigrid methods. Due to the explosion of parallelism in todays architecture designs, the significance and the need for asynchronous methods, as the ones described in this work, is expected to grow.

97 MATHEMATICS AND COMPUTING↗

Enhanced relaxed physical factorization preconditioner for coupled poromechanics

The relaxed physical factorization (RPF) preconditioner is a recent algorithm allowing for the efficient and robust solution to the block linear systems arising from the three-field displacement-velocity-pressure formulation of coupled poromechanics. For its application, however, it is necessary to invert blocks with the algebraic form C^ = (C + βFF T ), where C is a symmetric positive definite matrix, FF T a rank-deficient term, and β a real non-negative coefficient. The inversion of C^, performed in an inexact way, can become unstable for large values of β, as it usually occurs at some stages of a full poromechanical simulation. In this work, we propose a family of algebraic techniques to stabilize the inexact solve with C^. This strategy can prove useful in other problems as well where such an issue might arise, such as augmented Lagrangian preconditioning techniques for Navier-Stokes or incompressible elasticity. First, we introduce an iterative scheme obtained by a natural splitting of matrix C^. Second, we develop a technique based on the use of a proper projection operator annihilating the near-kernel modes of C^. Both approaches give rise to a novel class of preconditioners denoted as Enhanced RPF (ERPF). Furthermore, effectiveness and robustness of the proposed algorithms are demonstrated in both theoretical benchmarks and real-world large-size applications, outperforming the native RPF preconditioner.

97 MATHEMATICS AND COMPUTING↗

Numerical analysis of flows of rarefied gases in long channels with octagonal cross section shapes

Isothermal, pressure driven rarefied gas flows through long channels with octagonal cross section shapes are analyzed computationally. The capillary is between inlet and outlet reservoirs. The cross section is constant along the axial direction. The boundary condition at the solid-gas interface is assumed to be diffuse reflection. Since the channel is long, the gaseous velocity is small compared to the average molecular speed. Consequently, a linearized description can be used. The flow is described by the linearized Bhatnagar-Gross-Krook kinetic model. The solution of the problem is divided into two stages. First, the local flow field is determined by assuming the local pressure gradient. Secondly, the global flow behavior is deduced by the consideration of the conservation of the mass along the axis of the capillary. The kinetic equation is solved by the discrete velocity method on the cross section. Both spatial and velocity spaces are discretized. A body fitted rectangular grid is used for the spatial space. Near the boundary, first-order, while in the interior part of the flow domain, second-order finite-differences are applied to approximate the spatial derivatives. This combination results into an efficient and straightforward numerical treatment. The velocity space is represented by a Gauss-Legendre quadrature. The kinetic equation is solved in an iterative manner. The local dimensionless flow rate is calculated and tabulated for a wide range of the gaseous rarefaction for octagonal cross sections with various geometrical parameters. It exhibits the Knudsen minimum phenomenon. The flow rates in the octagonal channel are compared to those through capillaries with circular and square cross sections. Typical velocity profiles are also shown. The mass flow rate and the distribution of the pressure are determined and presented for global pressure driven flows.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗