Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Iterative refinement”

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 163 records · Page 9

A Method for Dimensionally Adaptive Sparse Trigonometric Interpolation of Periodic Functions

We present a method for dimensionally adaptive sparse trigonometric interpolation of multidimensional periodic functions belonging to a smoothness class of finite order. This method targets applications where periodicity must be preserved and the precise anisotropy is not known a priori. To the authors' knowledge, this is the first instance of a dimensionally adaptive sparse interpolation algorithm that uses a trigonometric interpolation basis. The motivating application behind this work is the adaptive approximation of a multi-input model for a molecular potential energy surface (PES) where each input represents an angle of rotation. Our method is based on an anisotropic quasi-optimal estimate for the decay rate of the Fourier coefficients of the model; a least-squares fit to the coefficients of the interpolant is used to estimate the anisotropy. Thus, our adaptive approximation strategy begins with a coarse isotropic interpolant, which is gradually refined using the estimated anisotropic rates. The procedure takes several iterations where ever-more accurate interpolants are used to generate ever-improving anisotropy rates. We present several numerical examples of our algorithm where the adaptive procedure successfully recovers the theoretical “best” convergence rate, including an application to a periodic PES approximation. An open-source implementation of our algorithm resides in the Tasmanian UQ library developed at Oak Ridge National Laboratory.

97 MATHEMATICS AND COMPUTING↗

An Adaptive Newton-Based Free-Boundary Grad–Shafranov Solver

Equilibria in magnetic confinement devices result from force balancing between the Lorentz force and the plasma pressure gradient. In an axisymmetric configuration like a tokamak, such an equilibrium is described by an elliptic equation for the poloidal magnetic flux, commonly known as the Grad–Shafranov equation. It is challenging to develop a scalable and accurate free-boundary Grad–Shafranov solver, since it is a fully nonlinear optimization problem that simultaneously solves for the magnetic field coil current outside the plasma to control the plasma shape. In this work, we develop a Newton-based free-boundary Grad–Shafranov solver using adaptive finite elements and preconditioning strategies. The free-boundary interaction leads to the evaluation of a domain-dependent nonlinear form of which its contribution to the Jacobian matrix is achieved through shape calculus. The optimization problem aims to minimize the distance between the plasma boundary and specified control points while satisfying two nontrivial constraints, which correspond to the nonlinear finite element discretization of the Grad–Shafranov equation and a constraint on the total plasma current involving a nonlocal coupling term. The linear system is solved by a block factorization, and AMG is called for subblock elliptic operators. The unique contributions of this work include the treatment of a global constraint, preconditioning strategies, nonlocal reformulation, and the implementation of adaptive finite elements. Furthermore, it is found that the resulting Newton solver is robust, successfully reducing the nonlinear residual to 1e-6 and lower in a small handful of iterations while addressing the challenging case to find a Taylor state equilibrium where conventional Picard-based solvers fail to converge.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Advanced Newton methods for geodynamical models of Stokes flow with viscoplastic rheologies

Strain localization and resulting plasticity and failure play an important role in the evolution of the lithosphere. These phenomena are commonly modeled by Stokes flows with viscoplastic rheologies. The nonlinearities of these rheologies make the numerical solution of the resulting systems challenging, and iterative methods often converge slowly or not at all. Yet accurate solutions are critical for representing the physics. Moreover, for some rheology laws, aspects of solvability are still unknown. We study a basic but representative viscoplastic rheology law. The law involves a yield stress that is independent of the dynamic pressure, referred to as von Mises yield criterion. Two commonly used variants, perfect/ideal and composite viscoplasticity, are compared. We derive both variants from energy minimization principles, and we use this perspective to argue when solutions are unique. We propose a new stress-velocity Newton solution algorithm that treats the stress as an independent variable during the Newton linearization but requires solution only of Stokes systems that are of the usual velocity-pressure form. To study different solution algorithms, we implement 2-D and 3-D finite element discretizations, and we generate Stokes problems with up to 7 orders of magnitude viscosity contrasts, in which compression or tension results in significant nonlinear localization effects. Comparing the performance of the proposed Newton method with the standard Newton method and the Picard fixed-point method, we observe a significant reduction in the number of iterations and improved stability with respect to problem nonlinearity, mesh refinement, and the polynomial order of the discretization.

Rudi, Johann↗

Robust Refinement as Implemented in TOPAS

A robust refinement procedure is implemented in the program TOPAS through an iterative reweighting of the data. Examples are given of the procedure as applied to fitting partially overlapped peaks by full and partial models and also of the structures of ibuprofen and acetaminophen in the presence of unmodeled impurity contributions

36 MATERIALS SCIENCE↗

An adaptive discontinuous Petrov-Galerkin method for the Grad-Shafranov equation

In this work, we propose and develop an arbitrary-order adaptive discontinuous Petrov--Galerkin (DPG) method for the nonlinear Grad--Shafranov equation. An ultraweak formulation of the DPG scheme for the equation is given based on a minimal residual method. The DPG scheme has the advantage of providing more accurate gradients compared to conventional finite element methods, which is desired for numerical solutions to the Grad--Shafranov equation. The numerical scheme is augmented with an adaptive mesh refinement approach, and a criterion based on the residual norm in the minimal residual method is developed to achieve dynamic refinement. Nonlinear solvers for the resulting system are explored and a Picard iteration with Anderson acceleration is found to be efficient to solve the system. Finally, the proposed algorithm is implemented in parallel on MFEM using a domain-decomposition approach, and our implementation is general, supporting arbitrary order of accuracy and general meshes. Furthermore, numerical results are presented to demonstrate the efficiency and accuracy of the proposed algorithm.

97 MATHEMATICS AND COMPUTING↗

A refined methodology for stress inversions of earthquake focal mechanisms: Refined Stress Inversion Methodology

We develop an improved methodology for reliable high-resolution inversions of focal mechanisms to background stress field orientation and stress ratio R in two or three dimensions. The earthquake catalog is declustered to remove events likely affected strongly by local stress interactions rather than reflecting the large-scale background stress field. The declustered data are discretized with the k-means algorithm into groups containing a number of focal mechanisms between a minimum number N min and 2N min . Synthetic tests indicate that N min ≈ 30 provides stable inversion results under different stress regimes and noise conditions when R ≈ 0.5, while N min ≈ 45 is needed for R near 0 or 1. Additional synthetic tests compare the performance of selecting the fault plane of each focal mechanism using (a) the plane with lowest misfit angle between the slip vector from the focal mechanism and shear traction from the stress tensor and (b) the plane with highest instability coefficient representing proximity to the optimally oriented fault for given stress field and friction coefficient. The instability criterion is found to provide more accurate inversion results under all tested stress regimes, stress ratios, and noise conditions. The refined inversion methodology combines selecting fault planes using the instability criterion iteratively with a damped simultaneous inversion of different focal mechanism groups. Results characterizing neighborhoods of discretized domains merged during the damped inversion provide high-resolution information independent of the discretization. Some aspects of the methodology are illustrated with focal mechanism data from the San Jacinto Fault Zone in Southern California.

58 GEOSCIENCES↗

Advancing the STS Neutron Moderator Design with an Automated Optimization Workflow and Unstructured Mesh Modeling

With the Second Target Station approaching its final design phase, a detailed neutronics evaluation of its critical components is necessary. Optimizing the dimensions of the two cold-source moderators that are at the heart of this facility presents a multi-objective optimization problem for which an accurate geometric description is crucial. We have applied a fully automated optimization workflow in which a detailed unstructured mesh geometry is automatically generated with Attila4MC, starting from a parametrized CREO geometry followed by preprocessing with SpaceClaim. With this geometry, a MCNP run is performed to calculate the brightness metrics, which are subsequently provided to the optimization algorithm in DAKOTA that provides new parameters and drives the optimization loop until convergence. In this paper, we show the results of the analysis that are used for the final design of the cylindrical and tube moderator. The optimization simulations provide a refinement to and confirmation of the conclusions of the previous design iteration. Additional to the optimization, a sensitivity study is performed to study the effect of minor geometry changes, which is important for the final engineering design. In conclusion, with these studies, we demonstrate that the automated workflow and high-fidelity unstructured mesh modeling are efficient tools for a thorough design evaluation.

DAKOTA↗

Learning with Adaptive Conservativeness for Distributionally Robust Optimization: Incentive Design for Voltage Regulation

Information asymmetry between the Distribution System Operator (DSO) and Distributed Energy Resource Aggregators (DERAs) obstructs designing effective incentives for voltage regulation. To capture this effect, we employ a Stackelberg game-theoretic framework, where the DSO seeks to overcome the information asymmetry and refine its incentive strategies by learning from DERA behavior over multiple iterations. We introduce a model-based online learning algorithm for the DSO, aimed at inferring the relationship between incentives and DERA responses. Given the uncertain nature of these responses, we also propose a distributionally robust incentive design model to control the probability of voltage regulation failure and then reformulate it into a convex problem. This model allows the DSO to periodically revise distribution assumptions on uncertain parameters in the decision model of the DERA. Finally, we present a gradient-based method that permits the DSO to adaptively modify its conservativeness level, measured by the size of a Wasserstein metric-based ambiguity set, according to historical voltage regulation performance. The effectiveness of our proposed method is demonstrated through numerical experiments.

adaptation models↗

Attributes from NMIS Time Coincidence, Fast-Neutron Imaging, Fission Mapping, And Gamma-Ray Spectrometry Data

This work tests a systematic procedure for analyzing data acquired by the Nuclear Materials Identification System (NMIS) at Oak Ridge National Laboratory with fast-neutron imaging and high-purity germanium (HPGe) gamma spectrometry capabilities. NMIS has been under development by the US Department of Energy Office of Nuclear Verification since the mid-1990s, and prior to that by the National Nuclear Security Administration Y-12 National Security Complex, with NMIS having been used at Y-12 for template matching to confirm inventory and receipts. In this present work, a complete set of NMIS time coincidence, fast-neutron imaging, fission mapping, and HPGe gamma-ray spectrometry data was obtained from Monte Carlo simulations for a configuration of fissile and nonfissile materials. The data were then presented for analysis to someone who had no prior knowledge of the unknown object to accurately determine the description of the object by applying the previously mentioned procedure to the simulated data. The best approximation indicated that the unknown object was composed of concentric cylinders: a void inside highly enriched uranium (HEU) (84.7 {+-} 1.9 wt % 235 U), surrounded by depleted uranium, surrounded by polyethylene. The final estimation of the unknown object had the correct materials and geometry, with error in the radius estimates of material regions varying from 1.58% at best and 4.25% at worst; error in the height estimates varied from 2% to 12%. The error in the HEU enrichment estimate was 5.9 wt % (within 2.5Σ of the true value). The accuracies of the determinations could be adequate for arms control applications. Future work will apply this iterative reconstructive procedure to other unknown objects to further test and refine it.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Learning with Adaptive Conservativeness for Distributionally Robust Optimization: Incentive Design for Voltage Regulation: Preprint

Information asymmetry between the Distribution System Operator (DSO) and Distributed Energy Resource Aggregators (DERAs) obstructs designing effective incentives for voltage regulation. To capture this effect, we employ a Stackelberg game-theoretic framework, where the DSO seeks to overcome the information asymmetry and refine its incentive strategies by learning from DERA behavior over multiple iterations. We introduce a model-based online learning algorithm for the DSO, aimed at inferring the relationship between incentives and DERA responses. Given the uncertain nature of these responses, we also propose a distributionally robust incentive design model to control the probability of voltage regulation failure and then reformulate it into a convex problem. This model allows the DSO to periodically revise distribution assumptions on uncertain parameters in the decision model of the DERA. Finally, we present a gradient-based method that permits the DSO to adaptively modify its conservativeness level, measured by the size of a Wasserstein metric-based ambiguity set, according to historical voltage regulation performance. The effectiveness of our proposed method is demonstrated through numerical experiments.

distribution system operator↗

Space-Time Block Preconditioning for Incompressible Flow

Parallel-in-time methods have become increasingly popular in the simulation of time-dependent numerical PDEs, allowing for the efficient use of additional message passing interface processes when spatial parallelism saturates. Most methods treat the solution and parallelism in space and time separately. In contrast, all-at-once methods solve the full space-time system directly, largely treating time as simply another spatial dimension. All-at-once methods offer a number of benefits over separate treatment of space and time, most notably significantly increased parallelism and faster time to solution (when applicable). However, the development of fast, scalable all-at-once methods has largely been limited to time-dependent (advection-)diffusion problems. This paper introduces the concept of space-time block preconditioning for the all-at-once solution of incompressible flow. By extending well-known concepts of spatial block preconditioning to the space-time setting, we develop a block preconditioner whose application requires the solution of a space-time (advection-)diffusion equation in the velocity block, coupled with a pressure Schur complement approximation consisting of independent spatial solves at each time-step, and a space-time matrix-vector multiplication. The new method is tested on four classical models in incompressible flow. Finally, the results indicate perfect scalability in refinement of spatial and temporal mesh spacing, perfect scalability in nonlinear Picard iteration count when applied to a nonlinear Navier--Stokes problem, and minimal overhead in terms of number of preconditioner applications compared with sequential time-stepping.

97 MATHEMATICS AND COMPUTING↗

Development of a Novel Accelerator for Neutron Transport Solution Using the Galerkin Spectral Element Methods (Final Report)

This report summarizes the results of a three-year research project sponsored by the U.S. Department of Energy (DOE) Nuclear Energy University Program (NEUP) to develop and implement advanced acceleration schemes for the DOE NEAMS neutronics code PROTEUSSN. The project team included the University of Massachusetts Lowell, The Ohio State University, University of Michigan, and Argonne National Laboratory. The PROTEUS code is a high-fidelity capable deterministic neutron transport code based on unstructured finite element meshes, which solves the steady-state and transient neutron transport problem using the 2nd-order discrete ordinate method (SN2ND), the method of characteristics (MOC), and the advanced nodal transport method (NODAL). The DSA scheme has been implemented in PROTEUS to speed up SN transport calculations. The existing DSA scheme employs a consistent finite element formulation on the same fine mesh structure as the SN solution While the use of consistent discretizations makes the DSA method effective, it does not necessarily make it efficient because the numerical solution of a discretized elliptic diffusion problem itself can be costly, particularly when the problem size becomes large. We developed a new discontinuous Galerkin (DG) discretization of the diffusion equation, called DG-DSA, which can effectively and efficiently accelerate the SN transport iterations. As compared with the previous work, the novelty of our method is that the diffusion equation is solved on a coarse-mesh grid using the DG methods, and the DG diffusion discretization incorporates local hp adaptation, i.e., local adaptation of mesh size and/or polynomial degree, based on local total cross section (or optical thickness). Therefore, the resulting number of degrees of freedom (DOF) of the DG discretization is much less than the conventional consistent DSA discretizations, and thus DG-DSA can achieve significant improvement in computational efficiency. We implemented this scheme in PROTEUS-SN. In addition, we developed a new stabilization scheme named linear prolongation CMFD (lpCMFD). A novel feature of this scheme is that the conventional flat flux ratio–based scaling approach is replaced with a linear interpolation of the scalar flux differences at the coarse-mesh cell edges between the neutron transport and CMFD calculations. Fourier convergence analysis and numerical results show that lpCMFD is unconditionally stable and more effective than other CMFD based on acceleration schemes such as pCMFD, odCMFD. We also developed a new nonlinear diffusion acceleration scheme for solving neutron transport equations. This scheme, called LR-NDA, employs a local refinement approach on the framework of CMFD by solving a local boundary value problem of the scalar flux on the coarse-mesh structure to replace the piecewise constant scalar flux obtained by CMFD. The refined flux is then used to update the scalar flux in the neutron transport source iteration. It has been demonstrated that that LR-NDA is much more effective and stable than CMFD for a wide range of optical thicknesses. LR-NDA is a local adaptive method, which means LR-NDA does not necessarily require local refinement for all the coarse-mesh cells on the problem domain, i.e., it can be used only for relatively optically thick regions where the standard CMFD scheme would encounter the convergence problem.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A Refined Method to Translate Solar Data Quality Assessment Flags to Estimated Measurement Uncertainty

Integrating solar resource uncertainties due to radiometer measurement performance and operational data quality assessment can provide improved estimates of economic bankability, system design performance, and compliance of solar energy conversion systems. Estimating radiometer measurement uncertainty is an established procedure consistent with recognized best practices and international guidelines. SERI QC is a robust solar data quality assessment software tool that has been in continuous use for more than three decades. This report, the fourth of six for the Data Quality and Uncertainty Integration Project, presents a refined algorithm description for software to translate solar resource data quality assessment results into estimated uncertainty values in a Solar Resource Operational Uncertainty Integrator (SROUI) application. This algorithm requires three-component solar irradiance measurements - global horizontal irradiance, direct normal irradiance, and diffuse horizontal irradiance - collected at 1- to 60-minute intervals, as described in the previous deliverables. The development of this report as Deliverable 6.4 was an iterative process that included reviews and feedback from the project team on initial drafts designed to refine how the new software could best support determining solar resource data uncertainty. The results of this effort will contribute to the final software system development by National Renewable Energy Laboratory staff.

14 SOLAR ENERGY↗

PROGRESS TOWARDS NEXT GENERATION, WAVEFORM BASED THREE-DIMENSIONAL MODELS AND METRICS TO IMPROVE NUCLEAR EXPLOSION MONITORING IN THE MIDDLE EAST

Efforts to update current wave speed models of the Middle East require a thoroughly tested database of sources and recordings. Recordings of seismic waves traversing the region from Tibet to the Red Sea will be the principal metric in guiding improvements to the current wave speed model. Precise characterizations of the earthquakes, specifically depths and faulting mechanisms, are essential to avoid mapping source errors into the refined wave speed model. Errors associated with the source are manifested in amplitude and phase changes. Source depths and paths near nodal planes are particularly error prone as small changes may severely affect the resulting wavefield. Once sources are quantified, regions requiring refinement will be highlighted using adjoint tomography methods based on spectral element simulations [Komatitsch and Tromp (1999)]. An initial database of 250 regional Middle Eastern events from 1990-2007, was inverted for depth and focal mechanism using teleseismic arrivals [Kikuchi and Kanamori (1982)] and regional surface and body waves [Zhao and Helmberger (1994)]. From this initial database, we reinterpreted a large, well recorded subset of 201 events through a direct comparison between data and synthetics based upon a centroid moment tensor inversion [Liu et al. (2004)]. Evaluation was done using both a 1D reference model [Dziewonski and Anderson (1981)] at periods greater than 80 seconds and a 3D model [Kustowski et al. (2008)] at periods of 25 seconds and longer. The final source reinterpretations will be within the 3D model, as this is the initial starting point for the adjoint tomography. Transitioning from a 1D to 3D wave speed model shows dramatic improvements when comparisons are done at shorter periods, (25 s). Synthetics from the 1D model were created through mode summations while those from the 3D simulations were created using the spectral element method. To further assess errors in source depth and focal mechanism, comparisons between the three methods were made. These comparisons help to identify problematic stations and sources which may bias the final solution. Estimates of standard errors were generated for each event's source depth and focal mechanism to identify poorly constrained events. A final, well characterized set of sources and stations will be then used to iteratively improve the wave speed model of the Middle East. After a few iterations during the adjoint inversion process, the sources will be reexamined and relocated to further reduce mapping of source errors into structural features. Finally, efforts continue in developing the infrastructure required to 'quickly' generate event kernels at the n-th iteration and invert for a new, (n+1)-th, wave speed model of the Middle East. While development of the infrastructure proceeds, initial tests using a limited number of events shows the 3D model, while showing vast improvement compared to the 1D model, still requires substantial modifications. Employing our new, full source set and iterating the adjoint inversions at successively shorter periods will lead to significant changes and refined wave speed structures of the Middle East.

58 GEOSCIENCES↗

LiDAR-Aided Interior Orientation Parameters Refinement Strategy for Consumer-Grade Cameras Onboard UAV Remote Sensing Systems

Unmanned aerial vehicles (UAVs) are quickly emerging as a popular platform for 3D reconstruction/modeling in various applications such as precision agriculture, coastal monitoring, and emergency management. For such applications, LiDAR and frame cameras are the two most commonly used sensors for 3D mapping of the object space. For example, point clouds for the area of interest can be directly derived from LiDAR sensors onboard UAVs equipped with integrated global navigation satellite systems and inertial navigation systems (GNSS/INS). Imagery-based mapping, on the other hand, is considered to be a cost-effective and practical option and is often conducted by generating point clouds and orthophotos using structure from motion (SfM) techniques. Mapping with photogrammetric approaches requires accurate camera interior orientation parameters (IOPs), especially when direct georeferencing is utilized. Most state-of-the-art approaches for determining/refining camera IOPs depend on ground control points (GCPs). However, establishing GCPs is expensive and labor-intensive, and more importantly, the distribution and number of GCPs are usually less than optimal to provide adequate control for determining and/or refining camera IOPs. Moreover, consumer-grade cameras with unstable IOPs have been widely used for mapping applications. Therefore, in such scenarios, where frequent camera calibration or IOP refinement is required, GCP-based approaches are impractical. To eliminate the need for GCPs, this study uses LiDAR data as a reference surface to perform in situ refinement of camera IOPs. The proposed refinement strategy is conducted in three main steps. An image-based sparse point cloud is first generated via a GNSS/INS-assisted SfM strategy. Then, LiDAR points corresponding to the resultant image-based sparse point cloud are identified through an iterative plane fitting approach and are referred to as LiDAR control points (LCPs). Finally, IOPs of the utilized camera are refined through a GNSS/INS-assisted bundle adjustment procedure using LCPs. Seven datasets over two study sites with a variety of geomorphic features are used to evaluate the performance of the developed strategy. The results illustrate the ability of the proposed approach to achieve an object space absolute accuracy of 3–5 cm (i.e., 5–10 times the ground sampling distance) at a 41 m flying height.

47 OTHER INSTRUMENTATION↗

Importance truncation for large-scale configuration interaction approaches

We introduce an iterative importance truncation scheme that aims at reducing the dimension of the model space of configuration interaction approaches by an a priori selection of the physically most relevant basis states. Using an importance measure derived from multiconfigurational perturbation theory in combination with an importance threshold, we construct a model space optimized for the description of individual eigenstates of a given Hamiltonian. We discuss in detail various technical aspects and refinements of the importance truncation, such as perturbative corrections for excluded basis states, threshold extrapolation techniques, and different iterative model-space update schemes. We apply the idea of the importance truncation in the context of the no-core shell model (NCSM) for the ab initio description of nuclear ground states. In a series of benchmark calculations for closed- and open-shell nuclei up to {sup 16}O, we compare the ground-state energies obtained in the importance truncated NCSM to the full NCSM. All calculations show an excellent agreement of importance truncated and full NCSM for all cases where the latter is feasible. The results demonstrate that the importance truncated NCSM, while preserving most of the advantages of the full NCSM, gives access to much larger N{sub max}({Dirac_h}/2{pi}){omega} spaces and heavier nuclei. In this way we are able to perform importance truncated NCSM calculations for nuclei such as {sup 12}C and {sup 16}O up to N{sub max}=22.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Electromagnetic mixing laws: A supersymmetric approach

In this article we address the old problem of finding the effective dielectric constant of materials described either by a local random dielectric constant, or by a set of non-overlapping spherical inclusions randomly dispersed in a host. We use a unified theoretical framework, such that all the most important Electromagnetic Mixing Laws (EML) can be recovered as the first iterative step of a family of results, thus opening the way to future improvements through the refinements of the approximation schemes. When the material is described by a set of immersed inclusions characterized by their spatial correlation functions, we exhibit an EML which, being featured by a minimal approximation scheme, does not come from the multiple scattering paradigm. It is made of a pure Hori-Yonezawa formula, corrected by a power series of the inclusion density. The coefficients of the latter, which are given as sums of standard diagrams, are recast into electromagnetic quantities which calculation is amenable numerically thanks to codes available on the web. The methods used and developed in this work are generic and can be used in a large variety of areas ranging from mechanics to thermodynamics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

THE STRUCTURE OF 2MASS GALAXY CLUSTERS

We use a sample of galaxies from the Two Micron All Sky Survey Extended Source Catalog to refine a matched filter method of finding galaxy clusters that takes into account each galaxy's position, magnitude, and redshift if available. The matched filter postulates a radial density profile, luminosity function, and line-of-sight velocity distribution for cluster galaxies. We use this method to search for clusters in the galaxy catalog, which is complete to an extinction-corrected K-band magnitude of 13.25 and has spectroscopic redshifts for roughly 40% of the galaxies, including nearly all brighter than K = 11.25. We then use a stacking analysis to determine the average luminosity function, radial distribution, and velocity distribution of cluster galaxies in several richness classes, and use the results to update the parameters of the matched filter before repeating the cluster search. We also investigate the correlations between a cluster's richness and its velocity dispersion and core radius using these relations to refine priors that are applied during the cluster search process. After the second cluster search iteration, we repeat the stacking analysis. We find a cluster galaxy luminosity function that fits a Schechter form, with parameters M{sub K*} - 5log h = -23.64 {+-} 0.04 and {alpha} = -1.07 {+-} 0.03. We can achieve a slightly better fit to our luminosity function by adding a Gaussian component on the bright end to represent the brightest cluster galaxy population. The radial number density profile of galaxies closely matches a projected Navarro-Frenk-White profile at intermediate radii, with deviations at small radii due to well-known cluster centering issues and outside the virial radius due to correlated structure. The velocity distributions are Gaussian in shape, with velocity dispersions that correlate strongly with richness.

79 ASTRONOMY AND ASTROPHYSICS↗