cspice_gfsntc |
|||

## AbstractCSPICE_GFSNTC determines time intervals for which a coordinate of an surface intercept position vector satisfies a numerical constraint. ## I/OGiven: Parameters- All parameters described here are declared in the header file SpiceGF.h. See that file for parameter values. SPICE_GF_CNVTOL is the convergence tolerance used for finding endpoints of the intervals comprising the result window. SPICE_GF_CNVTOL is used to determine when binary searches for roots should terminate: when a root is bracketed within an interval of length SPICE_GF_CNVTOL, the root is considered to have been found. The accuracy, as opposed to precision, of roots found by this routine depends on the accuracy of the input data. In most cases, the accuracy of solutions will be inferior to their precision. Arguments- target the name of the target body. Optionally, you may supply the integer ID code for the object as an integer string. For example both 'MOON' and '301' are legitimate strings that indicate the moon is the target body. [1,c1] = size(obsrvr); char = class(obsrvr) or [1,1] = size(obsrvr); cell = class(obsrvr) On calling ## ExamplesAny numerical results shown for this example may differ between platforms as the results depend on the SPICE kernels used as input and the machine specific arithmetic implementation. The examples shown below require a frames kernel defining a a dynamic frame, Sun-Earth Motion. The frame defined by the sun-to-earth direction vector as the X axis. The Y axis in the earth orbital plane, and Z completing the right hand system. We name this frames kernel "sem.tf". \begindata FRAME_SEM = 10100000 FRAME_10100000_NAME = 'SEM' FRAME_10100000_CLASS = 5 FRAME_10100000_CLASS_ID = 10100000 FRAME_10100000_CENTER = 10 FRAME_10100000_RELATIVE = 'J2000' FRAME_10100000_DEF_STYLE = 'PARAMETERIZED' FRAME_10100000_FAMILY = 'TWO-VECTOR' FRAME_10100000_PRI_AXIS = 'X' FRAME_10100000_PRI_VECTOR_DEF = 'OBSERVER_TARGET_POSITION' FRAME_10100000_PRI_OBSERVER = 'SUN' FRAME_10100000_PRI_TARGET = 'EARTH' FRAME_10100000_PRI_ABCORR = 'NONE' FRAME_10100000_SEC_AXIS = 'Y' FRAME_10100000_SEC_VECTOR_DEF = 'OBSERVER_TARGET_VELOCITY' FRAME_10100000_SEC_OBSERVER = 'SUN' FRAME_10100000_SEC_TARGET = 'EARTH' FRAME_10100000_SEC_ABCORR = 'NONE' FRAME_10100000_SEC_FRAME = 'J2000' Example(1): Find the time during 2007 for which the latitude of the intercept point of the vector pointing from the sun towards the earth in the IAU_EARTH frame equals zero i.e. the intercept point crosses the equator. MAXWIN = 1000; TIMFMT = 'YYYY-MON-DD HR:MN:SC.###### (TDB) ::TDB ::RND'; DVEC = [ 1.; 0.; 0. ]; % % Load kernels. % cspice_furnsh( 'standard.tm' ); cspice_furnsh( 'sem.tf' ); % % Store the time bounds of our search interval in % the cnfine confinement window. % et = cspice_str2et( { '2007 JAN 01', '2008 JAN 01'} ); cnfine = cspice_wninsd( et(1), et(2) ); % % The latitude varies relatively slowly (46 degrees) during the % year. The extrema occur approximately every six months. % Search using a step size less than half that value (180 days). % For this example use eighty days (in units of seconds). % step = cspice_spd*80.; % % Perform four searches to determine the times when the latitude- % longitude box restriction conditions apply to the subpoint vector. % % Use geodetic coordinates. % adjust = 0.; adjust = 0.D0; refval = 0.D0; target = 'EARTH'; obsrvr = 'SUN'; dref = 'SEM'; method = 'Ellipsoid'; fixref = 'IAU_EARTH'; crdsys = 'LATITUDINAL'; coord = 'LATITUDE'; relate = '='; nintvls= MAXWIN; % % Use the same aberration correction flag as that in the SEM frame % definition. % abcorr = 'NONE'; result = ## ParticularsThis routine provides a simple interface for conducting searches for surface intercept vector coordinate value events. This routine determines a set of one or more time intervals within the confinement window when the selected coordinate of the surface intercept vector satisfies a caller-specified constraint. The resulting set of intervals is returned as a SPICE window. Below we discuss in greater detail aspects of this routine's solution process that are relevant to correct and efficient use of this routine in user applications. The Search Process ================== Regardless of the type of constraint selected by the caller, this routine starts the search for solutions by determining the time periods, within the confinement window, over which the specified coordinate function is monotone increasing and monotone decreasing. Each of these time periods is represented by a SPICE window. Having found these windows, all of the coordinate function's local extrema within the confinement window are known. Absolute extrema then can be found very easily. Within any interval of these "monotone" windows, there will be at most one solution of any equality constraint. Since the boundary of the solution set for any inequality constraint is contained in the union of - the set of points where an equality constraint is met - the boundary points of the confinement window the solutions of both equality and inequality constraints can be found easily once the monotone windows have been found. Step Size ========= The monotone windows (described above) are found using a two-step search process. Each interval of the confinement window is searched as follows: first, the input step size is used to determine the time separation at which the sign of the rate of change of coordinate will be sampled. Starting at the left endpoint of an interval, samples will be taken at each step. If a change of sign is found, a root has been bracketed; at that point, the time at which the time derivative of the coordinate is zero can be found by a refinement process, for example, using a binary search. Note that the optimal choice of step size depends on the lengths of the intervals over which the coordinate function is monotone: the step size should be shorter than the shortest of these intervals (within the confinement window). The optimal step size is *not* necessarily related to the lengths of the intervals comprising the result window. For example, if the shortest monotone interval has length 10 days, and if the shortest result window interval has length 5 minutes, a step size of 9.9 days is still adequate to find all of the intervals in the result window. In situations like this, the technique of using monotone windows yields a dramatic efficiency improvement over a state-based search that simply tests at each step whether the specified constraint is satisfied. The latter type of search can miss solution intervals if the step size is longer than the shortest solution interval. Having some knowledge of the relative geometry of the target and observer can be a valuable aid in picking a reasonable step size. In general, the user can compensate for lack of such knowledge by picking a very short step size; the cost is increased computation time. Note that the step size is not related to the precision with which the endpoints of the intervals of the result window are computed. That precision level is controlled by the convergence tolerance. Convergence Tolerance ===================== As described above, the root-finding process used by this routine involves first bracketing roots and then using a search process to locate them. "Roots" are both times when local extrema are attained and times when the distance function is equal to a reference value. All endpoints of the intervals comprising the result window are either endpoints of intervals of the confinement window or roots. Once a root has been bracketed, a refinement process is used to narrow down the time interval within which the root must lie. This refinement process terminates when the location of the root has been determined to within an error margin called the "convergence tolerance." The convergence tolerance used by this routine is set by the parameter SPICE_GF_CNVTOL. The value of SPICE_GF_CNVTOL is set to a "tight" value so that the tolerance doesn't become the limiting factor in the accuracy of solutions found by this routine. In general the accuracy of input data will be the limiting factor. The user may change the convergence tolerance from the default SPICE_GF_CNVTOL value by calling the routine cspice_gfstol, e.g. cspice_gfstol( tolerance value in seconds ) Call cspice_gfstol prior to calling this routine. All subsequent searches will use the updated tolerance value. Setting the tolerance tighter than SPICE_GF_CNVTOL is unlikely to be useful, since the results are unlikely to be more accurate. Making the tolerance looser will speed up searches somewhat, since a few convergence steps will be omitted. However, in most cases, the step size is likely to have a much greater affect on processing time than would the convergence tolerance. The Confinement Window ====================== The simplest use of the confinement window is to specify a time interval within which a solution is sought. However, the confinement window can, in some cases, be used to make searches more efficient. Sometimes it's possible to do an efficient search to reduce the size of the time period over which a relatively slow search of interest must be performed. Practical use of the coordinate search capability would likely consist of searches over multiple coordinate constraints to find time intervals that satisfies the constraints. An effective technique to accomplish such a search is to use the result window from one search as the confinement window of the next. Longitude and Right Ascension ============================= The cyclic nature of the longitude and right ascension coordinates produces branch cuts at +/- 180 degrees longitude and 0-360 longitude. Round-off error may cause solutions near these branches to cross the branch. Use of the SPICE routine cspice_wncond will contract solution windows by some epsilon, reducing the measure of the windows and eliminating the branch crossing. A one millisecond contraction will in most cases eliminate numerical round-off caused branch crossings. ## Required ReadingFor important details concerning this module's function, please refer to the CSPICE routine gfsntc_c. MICE.REQ GF.REQ SPK.REQ CK.REQ TIME.REQ WINDOWS.REQ ## Version-Mice Version 1.0.2, 18-NOV-2014, EDW (JPL) Edited I/O section to conform to NAIF standard for Mice documentation. -Mice Version 1.0.1, 05-SEP-2012, EDW (JPL) Edit to comments to correct search description. Edits to and corrections of argument descriptions and header. Header updated to describe use of cspice_gfstol. -Mice Version 1.0.0, 15-APR-2009, EDW (JPL) ## Index_EntriesGF surface intercept coordinate search |

Wed Apr 5 18:00:32 2017