Search

We report the first observation of the vertical and temporal structure of the H3+ emission at the auroral footprint of Io, as observed by Juno/JIRAM. The brightness vertical profile shows a maximum at 600 km above 1 bar, with no apparent difference between the Main Alfv\'en Wing spot emission and the tail of the footprint. This observation is more compatible with a broadband energy distribution of the precipitating electrons, than a monoenergetic one. The temporal profile of H3+ column density has been observed after the passage of the MAW and shows a hyperbolic decrease. A model of H3+ decay is proposed, which takes into account the second-order kinetic of dissociative recombination of H3+ ions with electrons. The model is found to be in very good agreement with Juno observation. The conversion factor from radiance to column density has been derived, as well as the half-life for H3+, which is not constant but inversely proportional to the H3+ column density. This explains the wide range of H3+ lifetimes proposed before.

We report recent observations of lava lakes within patera on Io made by the JIRAM imager/spectrometer on board the Juno spacecraft, taken during close observation occurred in the extended mission. At least 40 lava lakes have been identified from JIRAM observations. The majority (>50%) of paterae have elevated thermal signatures when imaged at sufficiently high spatial resolution (a few km/pixel), implying that lava lakes are ubiquitous on Io. The annular width of the spattering region around the margins, a characteristic of lava lakes, is of the order of few meters to tens of meters, the diameter of the observed lava lakes ranges from 10 to 100 km. The thickness of the crust in the center of some lava lakes is of the order of 5-10 m; we estimate that this crust is a few years old. Also, the bulk of the thermal emission comes from the much larger crust and not from the smaller exposed lava, so the total power output cannot be calculated from the 5-um radiance alone. Eight of the proposed lava lakes have never been reported previously as active hotspots.

Complex networks are made up of vertices and edges. The edges, which may be directed or undirected, are equipped with positive weights. Modeling complex systems that consist of different types of objects leads to multilayer networks, in which vertices in distinct layers represent different kinds of objects. Multiplex networks are special vertex-aligned multilayer networks, in which vertices in distinct layers are identified with each other and inter-layer edges connect each vertex with its copy in other layers and have a fixed weight $\gamma>0$ associated with the ease of communication between layers. This paper discusses two different approaches to analyze communication in a multiplex. One approach focuses on the multiplex global efficiency by using the multiplex path length matrix, the other approach considers the multiplex total communicability. The sensitivity of both the multiplex global efficiency and the multiplex total communicability to structural perturbations in the network is investigated to help to identify intra-layer edges that should be strengthened to enhance communicability., Comment: 16 pages, 4 tables

Complex networks are made up of vertices and edges. The latter connect the vertices. There are several ways to measure the importance of the vertices, e.g., by counting the number of edges that start or end at each vertex, or by using the subgraph centrality of the vertices. It is more difficult to assess the importance of the edges. One approach is to consider the line graph associated with the given network and determine the importance of the vertices of the line graph, but this is fairly complicated except for small networks. This paper compares two approaches to estimate the importance of edges of medium-sized to large networks. One approach computes partial derivatives of the total communicability of the weights of the edges, where a partial derivative of large magnitude indicates that the corresponding edge may be important. Our second approach computes the Perron sensitivity of the edges. A high sensitivity signals that the edge may be important. The performance of these methods and some computational aspects are discussed. Applications of interest include to determine whether a network can be replaced by a network with fewer edges with about the same communicability., Comment: 25 pages, 8 tables, 2 figures

Modeling complex systems that consist of different types of objects leads to multilayer networks, in which vertices are connected by both inter-layer and intra-layer edges. In this paper, we investigate multiplex networks, in which vertices in different layers are identified with each other, and the only inter-layer edges are those that connect a vertex with its copy in other layers. Let the third-order adjacency tensor $\mathcal{A}\in\R^{N\times N\times L}$ and the parameter $\gamma\geq 0$, which is associated with the ease of communication between layers, represent a multiplex network with $N$ vertices and $L$ layers. To measure the ease of communication in a multiplex network, we focus on the average inverse geodesic length, which we refer to as the multiplex global efficiency $e_\mathcal{A}(\gamma)$ by means of the multiplex path length matrix $P\in\R^{N\times N}$. This paper generalizes the approach proposed in \cite{NR23} for single-layer networks. We describe an algorithm based on min-plus matrix multiplication to construct $P$, as well as variants $P^K$ that only take into account multiplex paths made up of at most $K$ intra-layer edges. These matrices are applied to detect redundant edges and to determine non-decreasing lower bounds $e_\mathcal{A}^K(\gamma)$ for $e_\mathcal{A}(\gamma)$, for $K=1,2,\dots,N-2$. Finally, the sensitivity of $e_\mathcal{A}^K(\gamma)$ to changes of the entries of the adjacency tensor $\mathcal{A}$ is investigated to determine edges that should be strengthened to enhance the multiplex global efficiency the most., Comment: 18 pages, 1 figure, 5 tables

Let a network be represented by a simple graph $\mathcal{G}$ with $n$ vertices. A common approach to investigate properties of a network is to use the adjacency matrix $A=[a_{ij}]_{i,j=1}^n\in\R^{n\times n}$ associated with the graph $\mathcal{G}$, where $a_{ij}>0$ if there is an edge pointing from vertex $v_i$ to vertex $v_j$, and $a_{ij}=0$ otherwise. Both $A$ and its positive integer powers reveal important properties of the graph. This paper proposes to study properties of a graph $\mathcal{G}$ by also using the path length matrix for the graph. The $(ij)^{th}$ entry of the path length matrix is the length of the shortest path from vertex $v_i$ to vertex $v_j$; if there is no path between these vertices, then the value of the entry is $\infty$. Powers of the path length matrix are formed by using min-plus matrix multiplication and are important for exhibiting properties of $\mathcal{G}$. We show how several known measures of communication such as closeness centrality, harmonic centrality, and eccentricity are related to the path length matrix, and we introduce new measures of communication, such as the harmonic $K$-centrality and global $K$-efficiency, where only (short) paths made up of at most $K$ edges are taken into account. The sensitivity of the global $K$-efficiency to changes of the entries of the adjacency matrix also is considered., Comment: 16 pages

Complex systems that consist of different kinds of entities that interact in different ways can be modeled by multilayer networks. This paper uses the tensor formalism with the Einstein tensor product to model this type of networks. Several centrality measures, that are well known for single-layer networks, are extended to multilayer networks using tensors and their properties are investigated. In particular, subgraph centrality based on the exponential and resolvent of a tensor are considered. Krylov subspace methods are introduced for computing approximations of different measures for large multilayer networks., Comment: 28 pages, 4 figures

The ExoClock project has been created with the aim of increasing the efficiency of the Ariel mission. It will achieve this by continuously monitoring and updating the ephemerides of Ariel candidates over an extended period, in order to produce a consistent catalogue of reliable and precise ephemerides. This work presents a homogenous catalogue of updated ephemerides for 450 planets, generated by the integration of $\sim$18000 data points from multiple sources. These sources include observations from ground-based telescopes (ExoClock network and ETD), mid-time values from the literature and light-curves from space telescopes (Kepler/K2 and TESS). With all the above, we manage to collect observations for half of the post-discovery years (median), with data that have a median uncertainty less than one minute. In comparison with literature, the ephemerides generated by the project are more precise and less biased. More than 40\% of the initial literature ephemerides had to be updated to reach the goals of the project, as they were either of low precision or drifting. Moreover, the integrated approach of the project enables both the monitoring of the majority of the Ariel candidates (95\%), and also the identification of missing data. The dedicated ExoClock network effectively supports this task by contributing additional observations when a gap in the data is identified. These results highlight the need for continuous monitoring to increase the observing coverage of the candidate planets. Finally, the extended observing coverage of planets allows us to detect trends (TTVs - Transit Timing Variations) for a sample of 19 planets. All products, data, and codes used in this work are open and accessible to the wider scientific community., Comment: Recommended for publication to ApJS (reviewer's comments implemented). Main body: 13 pages, total: 77 pages, 7 figures, 7 tables. Data available at http://doi.org/10.17605/OSF.IO/P298N

This paper is concerned with the distance of a symmetric tridiagonal Toeplitz matrix $T$ to the variety of similarly structured singular matrices, and with determining the closest matrix to $T$ in this variety. Explicit formulas are presented, that exploit the analysis of the sensitivity of the spectrum of $T$ with respect to structure-preserving perturbations of its entries., Comment: 16 pages, 5 Figures

Modeling complex systems that consist of different types of objects leads to multilayer networks, where nodes in the different layers represent different kind of objects. Nodes are connected by edges, which have positive weights. A multilayer network is associated with a supra-adjacency matrix. This paper investigates the sensitivity of the communicability in a multilayer network to perturbations of the network by studying the sensitivity of the Perron root of the supra-adjacency matrix. Our analysis sheds light on which edge weights to make larger to increase the communicability of the network, and which edge weights can be made smaller or set to zero without affecting the communicability significantly., Comment: 20 pages, 1 figure, 7 tables

This paper is concerned with the determination of a close real banded positive definite Toeplitz matrix in the Frobenius norm to a given square real banded matrix. While it is straightforward to determine the closest banded Toeplitz matrix to a given square matrix, the additional requirement of positive definiteness makes the problem difficult. We review available theoretical results and provide a simple approach to determine a banded positive definite Toeplitz matrix., Comment: 14 pages,2 figures

A stellar occultation by Neptune's main satellite, Triton, was observed on 5 October 2017 from Europe, North Africa, and the USA. We derived 90 light curves from this event, 42 of which yielded a central flash detection. We aimed at constraining Triton's atmospheric structure and the seasonal variations of its atmospheric pressure since the Voyager 2 epoch (1989). We also derived the shape of the lower atmosphere from central flash analysis. We used Abel inversions and direct ray-tracing code to provide the density, pressure, and temperature profiles in the altitude range $\sim$8 km to $\sim$190 km, corresponding to pressure levels from 9 {\mu}bar down to a few nanobars. Results. (i) A pressure of 1.18$\pm$0.03 {\mu}bar is found at a reference radius of 1400 km (47 km altitude). (ii) A new analysis of the Voyager 2 radio science occultation shows that this is consistent with an extrapolation of pressure down to the surface pressure obtained in 1989. (iii) A survey of occultations obtained between 1989 and 2017 suggests that an enhancement in surface pressure as reported during the 1990s might be real, but debatable, due to very few high S/N light curves and data accessible for reanalysis. The volatile transport model analysed supports a moderate increase in surface pressure, with a maximum value around 2005-2015 no higher than 23 {\mu}bar. The pressures observed in 1995-1997 and 2017 appear mutually inconsistent with the volatile transport model presented here. (iv) The central flash structure does not show evidence of an atmospheric distortion. We find an upper limit of 0.0011 for the apparent oblateness of the atmosphere near the 8 km altitude., Comment: 52 pages, 26 figures in the main paper, 2 figures in appendix B, 9 figures in appendix C, 1 long table over 5 pages

One of the properties of interest in the analysis of networks is \emph{global communicability}, i.e., how easy or difficult it is, generally, to reach nodes from other nodes by following edges. Different global communicability measures provide quantitative assessments of this property, emphasizing different aspects of the problem. This paper investigates the sensitivity of global measures of communicability to local changes. In particular, for directed, weighted networks, we study how different global measures of communicability change when the weight of a single edge is changed; or, in the unweighted case, when an edge is added or removed. The measures we study include the \emph{total network communicability}, based on the matrix exponential of the adjacency matrix, and the \emph{Perron network communicability}, defined in terms of the Perron root of the adjacency matrix and the associated left and right eigenvectors. Finding what local changes lead to the largest changes in global communicability has many potential applications, including assessing the resilience of a system to failure or attack, guidance for incremental system improvements, and studying the sensitivity of global communicability measures to errors in the network connection data., Comment: 28 pages, 7 figures

The capability of a network to cope with threats and survive attacks is referred to as its robustness. This paper discusses one kind of robustness, commonly denoted structural robustness, which increases when the spectral radius of the adjacency matrix associated with the network decreases. We discuss computational techniques for identifying edges, whose removal may significantly reduce the spectral radius. Nonsymmetric adjacency matrices are studied with the aid of their pseudospectra. In particular, we consider nonsymmetric adjacency matrices that arise when people seek to avoid being infected by Covid-19 by wearing facial masks of different qualities., Comment: 18 pages, 5 figures

The detection of liquid water by the Mars Advanced Radar for Subsurface and Ionosphere Sounding (MARSIS) at the base of the south polar layered deposits in Ultimi Scopuli has reinvigorated the debate about the origin and stability of liquid water under present-day Martian conditions. To establish the extent of subglacial water in this region, we acquired new data, achieving extended radar coverage over the study area. Here, we present and discuss the results obtained by a new method of analysis of the complete MARSIS dataset, based on signal processing procedures usually applied to terrestrial polar ice sheets. Our results strengthen the claim of the detection of a liquid water body at Ultimi Scopuli and indicate the presence of other wet areas nearby. We suggest that the waters are hypersaline perchlorate brines, known to form at Martian polar regions and thought to survive for an extended period of time on a geological scale at below-eutectic temperatures.

Long-duration gamma-ray bursts (GRBs) originate from ultra-relativistic jets launched from the collapsing cores of dying massive stars. They are characterised by an initial phase of bright and highly variable radiation in the keV-MeV band that is likely produced within the jet and lasts from milliseconds to minutes, known as the prompt emission. Subsequently, the interaction of the jet with the external medium generates external shock waves, responsible for the afterglow emission, which lasts from days to months, and occurs over a broad energy range, from the radio to the GeV bands. The afterglow emission is generally well explained as synchrotron radiation by electrons accelerated at the external shock. Recently, an intense, long-lasting emission between 0.2 and 1 TeV was observed from the GRB 190114C. Here we present the results of our multi-frequency observational campaign of GRB~190114C, and study the evolution in time of the GRB emission across 17 orders of magnitude in energy, from $5\times10^{-6}$ up to $10^{12}$\,eV. We find that the broadband spectral energy distribution is double-peaked, with the TeV emission constituting a distinct spectral component that has power comparable to the synchrotron component. This component is associated with the afterglow, and is satisfactorily explained by inverse Compton upscattering of synchrotron photons by high-energy electrons. We find that the conditions required to account for the observed TeV component are not atypical, supporting the possibility that inverse Compton emission is commonly produced in GRBs.

On 28th January 2018, the large Trans-Neptunian Object (TNO) 2002TC302 occulted a m$_v= $15.3 star with ID 130957813463146112 in the Gaia DR2 stellar catalog. 12 positive occultation chords were obtained from Italy, France, Slovenia and Switzerland. Also, 4 negative detections were obtained near the north and south limbs. This represents the best observed stellar occultation by a TNO other than Pluto, in terms of the number of chords published thus far. From the 12 chords, an accurate elliptical fit to the instantaneous projection of the body, compatible with the near misses, can be obtained. The resulting ellipse has major and minor axes of 543 $\pm$ 18 km and 460 $\pm$ 11 km, respectively, with a position angle of 3 $\pm$ 1 degrees for the minor axis. This information, combined with rotational light curves obtained with the 1.5m telescope at Sierra Nevada Observatory and the 1.23m telescope at Calar Alto observatory, allows us to derive possible 3D shapes and density estimations for the body, based on hydrostatic equilibrium assumptions. The effective area equivalent diameter is $\sim$ 84 km smaller than the radiometrically derived diameter using thermal data from Herschel and Spitzer Space Telescopes. This might indicate the existence of an unresolved satellite of up to $\sim$ 300 km in diameter, to account for all the thermal flux, although the occultation and thermal diameters are compatible within their error bars given the considerable uncertainty of the thermal results. The existence of a potential satellite also appears to be consistent with other ground-based data presented here. From the effective occultation diameter combined with H$_V$ measurements we derive a geometric albedo of 0.147 $\pm$ 0.005, which would be somewhat smaller if 2002TC302 has a satellite. The best occultation light curves do not show any signs of ring features or any signatures of a global atmosphere., Comment: Accepted for publication in Astronomy & Astrophysics. 14 pages, 9 figures

Matrix functions play an important role in applied mathematics. In network analysis, in particular, the exponential of the adjacency matrix associated with a network provides valuable information about connectivity, as well as about the relative importance or centrality of nodes. Another popular approach to rank the nodes of a network is to compute the left Perron vector of the adjacency matrix for the network. The present article addresses the problem of evaluating matrix functions, as well as computing an approximation to the left Perron vector, when only some of the columns and/or some of the rows of the adjacency matrix are known. Applications to network analysis are considered, when only some sampled columns and/or rows of the adjacency matrix that defines the network are available. A sampling scheme that takes the connectivity of the network into account is described. Computed examples illustrate the performance of the methods discussed., Comment: 19 pages, 8 figures

The presence of liquid water at the base of the Martian polar caps has long been suspected but not observed. We surveyed the Planum Australe region using the Mars Advanced Radar for Subsurface and Ionosphere Sounding, a low-frequency radar on the Mars Express spacecraft. Radar profiles collected between May 2012 and December 2015, contain evidence of liquid water trapped below the ice of the South Polar Layered Deposits. Anomalously bright subsurface reflections were found within a well-defined, 20km wide zone centered at 193{\deg}E, 81{\deg}S, surrounded by much less reflective areas. Quantitative analysis of the radar signals shows that this bright feature has high dielectric permittivity >15, matching water-bearing materials. We interpret this feature as a stable body of liquid water on Mars., Comment: 27 pages, 10 figures

Context. Pluto's tenuous nitrogen (N2) atmosphere undergoes strong seasonal effects due to high obliquity and orbital eccentricity, and has been recently (July 2015) observed by the New Horizons spacecraft. Goals are (i) construct a well calibrated record of the seasonal evolution of surface pressure on Pluto and (ii) constrain the structure of the lower atmosphere using a central flash observed in 2015. Method: eleven stellar occultations by Pluto observed between 2002 and 2016 are used to retrieve atmospheric profiles (density, pressure, temperature) between $\sim$5 km and $\sim$380 km altitude levels (i.e. pressures from about 10 microbar to 10 nanobar). Results: (i) Pressure has suffered a monotonic increase from 1988 to 2016, that is compared to a seasonal volatile transport model, from which tight constraints on a combination of albedo and emissivity of N2 ice are derived; (ii) A central flash observed on 2015 June 29 is consistent with New Horizons REX profiles, provided that (a) large diurnal temperature variations (not expected by current models) occur over Sputnik Planitia and/or (b) hazes with tangential optical depth of about 0.3 are present at 4-7 km altitude levels and/or (c) the nominal REX density values are overestimated by an implausibly large factor of about 20% and/or (d) higher terrains block part of the flash in the Charon facing hemisphere., Comment: 21 pages, 11 figures

Relations between discrete quantities such as people, genes, or streets can be described by networks, which consist of nodes that are connected by edges. Network analysis aims to identify important nodes in a network and to uncover structural properties of a network. A network is said to be bipartite if its nodes can be subdivided into two nonempty sets such that there are no edges between nodes in the same set. It is a difficult task to determine the closest bipartite network to a given network. This paper describes how a given network can be approximated by a bipartite one by solving a sequence of fairly simple optimization problems. The algorithm also produces a node permutation which makes the possible bipartite nature of the initial adjacency matrix evident, and identifies the two sets of nodes. We finally show how the same procedure can be used to detect the presence of a large anti-community in a network and to identify it., Comment: 30 pages

The sensitivity of eigenvalues of structured matrices under general or structured perturbations of the matrix entries has been thoroughly studied in the literature. Error bounds are available and the pseudospectrum can be computed to gain insight. Few investigations have focused on analyzing the sensitivity of eigenvectors under general or structured perturbations. The present paper discusses this sensitivity for tridiagonal Toeplitz and Toeplitz-type matrices., Comment: 21 pages, 4 figures

GMRES is one of the most popular iterative methods for the solution of large linear systems of equations that arise from the discretization of linear well-posed problems, such as Dirichlet boundary value problems for elliptic partial differential equations. The method is also applied to iteratively solve linear systems of equations that are obtained by discretizing linear ill-posed problems, such as many inverse problems. However, GMRES does not always perform well when applied to the latter kind of problems. This paper seeks to shed some light on reasons for the poor performance of GMRES in certain situations, and discusses some remedies based on specific kinds of preconditioning. The standard implementation of GMRES is based on the Arnoldi process, which also can be used to define a solution subspace for Tikhonov or TSVD regularization, giving rise to the Arnoldi-Tikhonov and Arnoldi-TSVD methods, respectively. The performance of the GMRES, the Arnoldi-Tikhonov, and the Arnoldi-TSVD methods is discussed. Numerical examples illustrate properties of these methods.

Lucus Planum, extending for a radius of approximately 500 km around 181{\deg} E, 5{\deg} S, is part of the Medusae Fossae Formation (MFF), a set of several discontinuous deposits of fine-grained, friable material straddling across the Martian highland-lowland boundary. The MFF has been variously hypothesized to consist of pyroclastic flows, pyroclastic airfall, paleopolar deposits, or atmospherically-deposited icy dust driven by climate cycles. MARSIS, a low-frequency subsurface-sounding radar carried by ESA's Mars Express, acquired 238 radar swaths across Lucus Planum, providing sufficient coverage for the study of its internal structure and dielectric properties. Subsurface reflections were found only in three areas, marked by a distinctive surface morphology, while the central part of Lucus Planum appears to be made of radar-attenuating material preventing the detection of basal echoes. The bulk dielectric properties of these areas were estimated and compared with those of volcanic rocks and ice-dust mixtures. Previous interpretations that east Lucus Planum and the deposits on the north-western flanks of Apollinaris Patera consist of high-porosity pyroclastic material are strongly supported by the new results. The north-western part of Lucus Planum is likely to be much less porous, although interpretations about the nature of the subsurface materials are not conclusive. The exact origin of the deposits cannot be constrained by radar data alone, but our results for east Lucus Planum are consistent with an overall pyroclastic origin, likely linked to Tharsis Hesperian and Amazonian activity., Comment: 39 pages, 8 figures, 2 tables

Many applications in science and engineering require the solution of large linear discrete ill-posed problems that are obtained by the discretization of a Fredholm integral equation of the first kind in several space-dimensions. The matrix that defines these problems is very ill-conditioned and generally numerically singular, and the right-hand side, which represents measured data, typically is contaminated by measurement error. Straightforward solution of these problems generally is not meaningful due to severe error propagation. Tikhonov regularization seeks to alleviate this difficulty by replacing the given linear discrete ill-posed problem by a penalized least-squares problem, whose solution is less sensitive to the error in the right-hand side and to round-off errors introduced during the computations. This paper discusses the construction of penalty terms that are determined by solving a matrix-nearness problem. These penalty terms allow partial transformation to standard form of Tikhonov regularization problems that stem from the discretization of integral equations on a cube in several space-dimensions., Comment: 17 pages, 3 figures

In many applications it is important to understand the sensitivity of eigenvalues of a matrix polynomial to perturbations of the polynomial. The sensitivity commonly is described by condition numbers or pseudospectra. However, the computation of pseudospectra of matrix polynomials is very demanding computationally. This paper describes a new approach to computing approximations of pseudospectra of matrix polynomials by using rank-one or projected rank-one perturbations. These perturbations are inspired by Wilkinson's analysis of eigenvalue sensitivity. This approach allows the approximation of both structured and unstructured pseudospectra. Computed examples show the method to perform much better than a method based on random rank-one perturbations both for the approximation of structured and unstructured (i.e., standard) polynomial pseudospectra., Comment: 14 pages, 5 figures

Pseudospectra and structured pseudospectra are important tools for the analysis of matrices. Their computation, however, can be very demanding for all but small matrices. A new approach to compute approximations of pseudospectra and structured pseudospectra, based on determining the spectra of many suitably chosen rank-one or projected rank-one perturbations of the given matrix is proposed. The choice of rank-one or projected rank-one perturbations is inspired by Wilkinson's analysis of eigenvalue sensitivity. Numerical examples illustrate that the proposed approach gives much better insight into the pseudospectra and structured pseudospectra than random or structured random rank-one perturbations with lower computational burden. The latter approach is presently commonly used for the determination of structured pseudospectra., Comment: 15 pages, 10 figures

Circulant preconditioners are commonly used to accelerate the rate of convergence of iterative methods when solving linear systems of equations with a Toeplitz matrix. Block extensions that can be applied when the system has a block Toeplitz matrix with Toeplitz blocks also have been developed. This paper is concerned with preconditioning of linear systems of equations with a symmetric block Toeplitz matrix with symmetric Toeplitz blocks that stem from the discretization of a linear ill-posed problem. The right-hand side of the linear systems represents available data and is assumed to be contaminated by error. These kinds of linear systems arise, e.g., in image deblurring problems. It is important that the preconditioner does not affect the invariant subspace associated with the smallest eigenvalues of the block Toeplitz matrix to avoid severe propagation of the error in the right-hand side. A perturbation result indicates how the dimension of the subspace associated with the smallest eigenvalues should be chosen and allows the determination of a suitable preconditioner when an estimate of the error in the right-hand side is available. This estimate also is used to decide how many iterations to carry out by a minimum residual iterative method. Applications to image restoration are presented., Comment: 13 pages, 8 figures